Assume that a set s of n numbers are stored in some form of balanced binary search tree; i.e. the depth of the tree is O(logn). In addition to the key value and the pointers to children, assume that...

Assume that a set s of n numbers are stored in some form of balanced binary search tree; i.e. the depth of the tree is O(logn). In addition to the key value and the pointers to children, assume that every node contains the number of nodes in its sub tree. Specify a reason(s) why a balanced binary tree can be a better option than a complete binary tree for storing the set S.