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
- 2109 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 |
How does a selection sort work?
Define secondary clustering?
Is array a linked list?
What should be done in the base case for this recursive problem?
Define threaded binary tree.
Which is the parent class of hashmap class?
What is a directed graph?
Define open addressing?
How do you declare An array of three pointers to chars
Is bubble sort adaptive?
How do you find the time complexity of a bubble sort?
Describe queue operation.
Windows 
