数据结构9.avlt.pdfVIP

Efficient Binary Search Trees • Binary Search Tree • height can be as large as N • Complexity: Search, Insert, Delete • O(n) • We want a tree with small height • A binary tree with N node has height at least • (log N) • Our goal • keep the height of a binary search tree O(log N) balanced binary search trees • AVL tree – Adelson-Velskii and Landis • Red-black tree AVL Tree • an empty tree is height-balanced • If T is a nonempty binary tree with TL and TR as its left and right subtrees re