1. A B∗-tree of order M is a B-tree in which each interior node has between 2M/3 and M children. Describe a method to perform insertion into a B∗-tree.
2. Show how the tree in Figure 4.77 is represented using a child/sibling link implementation.
3. Write a procedure to traverse a tree stored with child/sibling links.
4. Two binary trees are similar if they are both empty or both nonempty and have similar left and right subtrees. Write a function to decide whether two binary trees are similar. What is the running time of your function?