Question 4 A Tree Is Called A Full M Ary Tree If Every Internal Vertex Has Exactly M Children An M Ary Tree With 1 (42.53 KiB) Viewed 60 times
help with all questions
QUESTION 4 A tree is called a (full) m - ary tree if every internal vertex has exactly m children. An m - ary tree with m = 2 is called a binary tree. Let T be a 9-vertex binary tree. (a) Find (i) the number of edges of T; (ii) the number of leaves of T; (iii) the number of internal vertices of T. (b) Draw all non-isomorphic 9-vertex binary rooted trees, indicating the root in each case. Prove that, up to isomorphism, these are the only such trees. [6+8=14]
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!