Given the following binary search tree with char keys and in

Given the following binary search tree, with char keys and int elements What is the height of the tree? What\'s the key at the root of the tree? How many leaves are in the tree? What\'s the key of the sibling of the node with key S? How many steps to find the key H? What is the minimum memory required if we want to store this tree with an array? Draw or describe rotation(s) and result to balance the tree, preserving inorder search:

Solution

a)Height of tree is 5

b)P is key

c)8 Leaves

d)M is key of sibling of s

a)Height of tree is 5

b)P is key

c)8 Leaves

d)M is key of sibling of s