aai question 2018

Question

 

In a full binary tree of height 10 the number of nodes with degree 0,1 and 2 will be ______ , ______,and _____ respectively

Note:-Consider height of a tree as the number of nodes in the longest path from root node to any leaf node.

A.- 511, 1 , 511

B.-511 , 0 , 512

C.-512 , 0  , 511

C.-512 , 1, 510

Answer 1

In full Binary Tree, A node can have either o child or 2 child. (A node with 1 child is not allowed).

So, Option A and D eliminated directly.

Now, second property is: internal nodes = leaf nodes-1  //internal nodes with degree 2 & leaf nodes with degree 0

So, leaf nodes(with degree 0)= 512 , Nodes with degree 1=0 And internal nodes(with degree 2)=511

Option C: 512, 0, 511