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
- 1985 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 |
Is a hashmap a dictionary?
List the types of rotations available in splay tree?
what is AVL tree?
What is the difference between list, set and map?
Which is better than array and linked list?
input function and output function in c language
What are the benefits of using arrays?
What is default size of hashmap?
How can we delete the first node from the singly linked list?
What is Storage Structures and File Structures? Can you show their relation? What are the examples of each? Thanks
What is difference between tree and binary tree?
Is quicksort divide and conquer?
Windows 
