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
- 2202 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 |
Write the disadvantages of separate chaining?
Define an algorithm. What are the types of algorithms?
What is bubble sort used for?
State the merit of linked representation of binary trees?
Is quicksort a stable sorting algorithm?
What is difference between list set and map?
What are the advantages of sorting and filtering data?
How do you find the time complexity of a bubble sort?
What is the space complexity of quicksort?
What is data structure what is need of it?
What do you mean by primary clustering?
Differentiate null and void?
Windows 
