Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 2113 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 | 1 No |
Can arraylist be empty?
Which sorting technique is best in worst case?
Define separate chaining?
Does concat mutate array?
Which of the collections allows null as the key?
How many types of data structures are there?
Define a relation?
Describe queue operation.
Differentiate between iterable and iterator.
How does a dynamic array work?
How does a treemap work?
How do you sort an arraylist in descending order?
Windows 
