d/freebsd-nq
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

tree.3: Bump date after 363450 (WAVL)

Browse Source 
While here:
- Address whitespace warnings.
- Start sentences on a new line.
This commit is contained in:
Mateusz Piotrowski 2020-07-27 11:42:22 +00:00
parent d421b01028
commit 58f5de0d8a
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
share/man/man3/tree.3
View File

@ -30,7 +30,7 @@
.\" .\"
.\" $FreeBSD$ .\" $FreeBSD$
.\" .\"
.Dd February 25, 2020 .Dd July 27, 2020
.Dt TREE 3 .Dt TREE 3
.Os .Os
.Sh NAME .Sh NAME
@ -371,7 +371,7 @@ Each tree node has an associated rank.
Balance conditions are expressed by conditions on the differences in Balance conditions are expressed by conditions on the differences in
rank between any node and its children. rank between any node and its children.
Rank differences are stored in each tree node. Rank differences are stored in each tree node.
.Pp .Pp
The balance conditions implemented by the RB macros lead to weak AVL The balance conditions implemented by the RB macros lead to weak AVL
(wavl) trees, which combine the best aspects of AVL and red-black (wavl) trees, which combine the best aspects of AVL and red-black
trees. trees.
@ -380,7 +380,8 @@ with the same worst-case time as red-black trees offer, and with
better balance in the resulting tree. better balance in the resulting tree.
Wavl trees rebalance after a removal in a way that requires less Wavl trees rebalance after a removal in a way that requires less
restructuring, in the worst case, than either AVL or red-black trees restructuring, in the worst case, than either AVL or red-black trees
do. Removals can lead to a tree almost as unbalanced as a red-black do.
Removals can lead to a tree almost as unbalanced as a red-black
tree; insertions lead to a tree becoming as balanced as an AVL tree. tree; insertions lead to a tree becoming as balanced as an AVL tree.
.Pp .Pp
A rank-balanced tree is headed by a structure defined by the A rank-balanced tree is headed by a structure defined by the