Algorithm Design and Applications
For each of the following statements about wavl trees, determine whether it is true or false. If you think it is true, provide a justification. If you think it is false, give a counterexample.
a. A subtree of a wavl tree is itself a wavl tree.
b. The sibling of an external node is either external or it has rank 1.