10 陈启峰《Size Balanced Tree》 | PDF | Mathematical Logic | Applied Mathematics

10 陈启峰《Size Balanced Tree》 - Free download as PDF File (.pdf), Text File (.txt) or read online for free. This document presents Size Balanced Trees, a type of self-balancing binary search tree that maintains balance based on the size of subtrees. Size Balanced Trees support common binary search tree operations like insertion, deletion, finding, ranking, and selecting in O(log n) time. They achieve this balance by enforcing two size properties on subtrees and performing rotations when properties are violated. Maintaining the tree after changes involves checking for violations of the size properties and performing appropriate rotations, like right-rotating at a node if its left child's left subtree is too large.