Question 1     

A

Each node has exactly zero or two children



B

Each node has exactly two children



C

All the leaves are at the same level



D

Each node has exactly one or two children

Question 2     

A

sequentially accessed



B

pointers



C

references



D

both a and b

Question 3     

A

Each node has exactly zero or two children



B

Each node has exactly two children



C

All the leaves are at the same level



D

Each node have at most 2 children

Question 4     

A

root



B

edge



C

top



D

siblings



E

leaf

Question 5     

A

2^l



B

2^{l - 1}



C

2^l - 1



D

2^{l - 1} - 1

Question 6     

A

2^h



B

2^h-1



C

2^h - 1



D

2^h-1 - 1

Question 7     

A

log₂(N)



B

log₂(N+1)



C

log₂(N)-1



D

log₂(N+1)-1

Question 8     

A

1



B

2



C

3



D

4

Question 9     

A

Each node has exactly 0 or 2 children



B

each node has exactly 2 children



C

All leaves are at same level



D

all levels are completely filled except at the last level.

Question 10     

A

Each node has exactly 0 or 2 children



B

Each node has exactly 2 children.



C

All the leaf nodes are at same level



D

all the levels are completely filled except the last level



E

Both 3 and 4