we saw that AVL trees satisfy the height-balance property, which means that for every internal node,...

 

Transcribed Image Text:

we saw that AVL trees satisfy the height-balance property, which means that for every internal node, the left child subtree and the right child subtree have height differing by at most 1. Consider a slight relaxation of the height-balance requirement, where, for every internal node, the left child subtree and the right child subtree have height which differs by at most 2. Let's call these trees "Relaxed AVL trees". Define N(h) to be the minimum number of elements that can be stored in a Relaxed AVL tree. Prove that N(h) = (kh) for some constant k> 1. Note that you do not have to find the largest k for which this holds. we saw that AVL trees satisfy the height-balance property, which means that for every internal node, the left child subtree and the right child subtree have height differing by at most 1. Consider a slight relaxation of the height-balance requirement, where, for every internal node, the left child subtree and the right child subtree have height which differs by at most 2. Let's call these trees "Relaxed AVL trees". Define N(h) to be the minimum number of elements that can be stored in a Relaxed AVL tree. Prove that N(h) = (kh) for some constant k> 1. Note that you do not have to find the largest k for which this holds.