A tree is called a (full) m ary tree if every internal vertex has exactly...

Transcribed Image Text:

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-verter binary tree. (a) Find (i) the number of edges of T; (ii) the number of leaves of T; (iii) the mumber of internal vertices of T. (b) Draw all non-isomorphic 9-verter binary rooted trees, indicating the root in each case. Prove that, up to isomorphism, these are the only such trees. 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-verter binary tree. (a) Find (i) the number of edges of T; (ii) the number of leaves of T; (iii) the mumber of internal vertices of T. (b) Draw all non-isomorphic 9-verter binary rooted trees, indicating the root in each case. Prove that, up to isomorphism, these are the only such trees.

Answer rating: 100% (QA)

Answer Explanation Solution a Jet T be a 9 Vertex binarytree O T... View the full answer