1.

There Are 8, 15, 13, 14 Nodes Were There In 4 Different Trees. Which Of Them Could Have Formed A Full Binary Tree?

Answer»

 In general: There are 2n-1 nodes in a full BINARY tree. By the method of ELIMINATION:

Full binary TREES contain odd number of nodes. So there cannot be full binary trees with 8 or 14 nodes, so rejected. With 13 nodes you can FORM a complete binary tree but not a full binary tree. So the correct answer is 15.

 In general: There are 2n-1 nodes in a full binary tree. By the method of elimination:

Full binary trees contain odd number of nodes. So there cannot be full binary trees with 8 or 14 nodes, so rejected. With 13 nodes you can form a complete binary tree but not a full binary tree. So the correct answer is 15.



Discussion

No Comment Found