Revision as of 19:50, 19 April 2023 edit 50.217.59.154 (talk) No edit summary Tag: Visual edit ← Previous edit		Revision as of 10:41, 28 April 2023 edit undo Tea2min (talk \| contribs) Extended confirmed users, Pending changes reviewers 21,969 edits m →Balanced binary search trees: Skip redirect from Red-Black tree to Red–black tree. Next edit →
Line 235: === Height-balanced trees === A tree is height-balanced if the heights of the left sub-tree and right sub-tree are guaranteed to be related by a constant factor. This property was introduced by the [[AVL tree]] and continued by the [[~~Red-Black~~red–black tree]].{{r\|peter11\|pp=50-51}} The heights of all the nodes on the path from the root to the modified leaf node have to be observed and possibly corrected on every insert and delete operation to the tree.{{r\|peter11\|pp=52}} === Weight-balanced trees ===

Binary search tree: Difference between revisions