We define an augmented binary search tree to be a binary search tree where each node v in the tree also stores the value size[v], which is equal to the number of nodes in the subtree rooted at v.

We define an augmented binary search tree to be a binary search tree where each node v in the tree also stores the value size[v], which is equal to the number of nodes in the subtree rooted at v. Show transcribed image text We define an augmented binary search tree to be a binary search tree where each node v in the tree also stores the value size[v], which is equal to the number of nodes in the subtree rooted at v.