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
- 1986 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
What are all the classes and interfaces that are available in the collections?
Which is better than array and linked list?
Why do we need a data structure?
Explain what are the major data structures used in the network data model?
What is impact of signed numbers on the memory using data structures?
Explain multiply linked list in short.
What sort does arrays sort use?
What is data structure and its operations?
What is a data structure definition?
What is a simple graph?
Define probing?
What is the difference between hashset and treeset?
What is a tech stack?
What are linked list?
What is map keyset?
