1. Disjoint Sets Data Structure (Chap. 21) A disjoint-set is a collection ={S 1 , S 2 ,…, S k } of distinct dynamic sets. Each set is identified by a member of the set,…

Slide 1 Augmenting AVL trees Slide 2 How we’ve thought about trees so far Good for determining ancestry Can be good for quickly finding an element Good for determining…

Slide 1 Balanced Binary Search Tree  Worst case height of binary search tree: N-1  Insertion, deletion can be O(N) in the worst case  We want a tree with small height…

Slide 1 AVL Trees / Slide 1 Balanced Binary Search Tree  Worst case height of binary search tree: N-1  Insertion, deletion can be O(N) in the worst case  We want…

Augmenting AVL trees How weâve thought about trees so far Good for determining ancestry Can be good for quickly finding an element Other kinds of uses? Any thoughts? Finding…

Augmenting AVL trees How weâve thought about trees so far Good for determining ancestry Can be good for quickly finding an element Other kinds of uses? Any thoughts? Finding…