There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree?
- 1 Answers
- 1239 Views
- I also Faced
- E-Mail Answers
Answer / rohit sah
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.
Note: Full and Complete binary trees are different. All full binary trees are complete binary trees but not vice versa.
| Is This Answer Correct ? | 0 Yes | 0 No |
Write a program for Sorting an Array. Which sorting will you prefer?
How to increase stack limit in w3wp.exe?
Explain singly linked list in short.
What is a singletonlist?
Is copyonwritearraylist thread safe?
State the difference between persistent and ephemeral data structure?
What is scalar example?
What is time complexity of binary search?
Is arraylist a list?
Is arraylist synchronized?
What are lists?
Why entry interface is used in map?
Windows 
