Q12

Explain. In Exercises 9-11, draw a graph having the given properties or explain why no such graph exists 9. Full binary tree; four internal vertices; five terminal vertices ertices 10. Fall binary tree height- nine terminal verices 11. Full binary tree; height 3; nine terminal vertices 12. A full m-ary tree is a rooted tree such that every parent has m ordered children. If T is a full m-ary tree with i internal ver tices, how many vertices does T have? How many terminal vertices does T have? Prove your results. 13. Give an algorithm for constructing a full binary tree withn > I 14. Give a recursive algorithm to insert a word in a binary search 15. Find the maximum height of a full binary tree having t termi- terminal vertices tree. nal vertices. 9.6 Tree Traversals