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
- 1428 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 |
What is a reverse linked list.
What is advantage and disadvantage of linked list?
How many types of sorting algorithms are there?
Explain binary searching, Fibinocci search.
Which collection class is thread safe?
Why is hashset used?
When should structures be passed by values or by reference?
Which interfaces are implemented by concurrentskiplistset?
Can we add elements to final list?
How does the bubble sort work?
How are the elements of a 2d array are stored in the memory?
Explain about the types of linked lists
Windows 
