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
- 2022 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 |
what is the difference between Linear Array and Linked List?
Is binary tree balanced?
What does map stand for?
How can a binary tree be represented using the rotation?
What is difference between list set and map?
Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))
33 Answers Amazon, Microsoft, Star Technologies, Sun Microsystems, Wipro,
What is the difference between list and arraylist?
Sorting is not possible by using which of the following methods? (a) Insertion (b) Selection (c) Exchange (d) Deletion
How to inverting a function in sort and searching?
How does the size of arraylist increases dynamically?
What is the time complexity of selection sort?
What is treemap chart?
Windows 
