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
- 2204 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 complexity algorithm?
What's difference between stack and queue?
What is comparable interface?
What does abstract data type mean?
Why is hashmap faster than arraylist?
Why is arraylist used?
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
What is example of data?
How do hash tables work?
Is heap sort faster than quicksort?
Which algorithm is used in collections sort method?
List some applications of tree-data structure?
Windows 
