Of the following tree structure, which is, efficient considering space and time complexities?
(a) Incomplete Binary Tree
(b) Complete Binary Tree
(c) Full Binary Tree
(b) Complete Binary Tree.
- 1 Answers
- 942 Views
- I also Faced
- E-Mail Answers
Answer Posted / sandeep vimal
By the method of elimination:
Full binary tree loses its nature when operations of insertions and deletions are done. For incomplete binary trees, extra storage is required and overhead of NULL node checking takes place. So complete binary tree is the better one since the property of complete binary tree is maintained even after operations like additions and deletions are done on it.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Does set allow null values?
What is time complexity of arrays sort?
Will this code give error if I try to add two heterogeneous elements in the arraylist? And why?
What is the best case time complexity of bubble sort?
Is hashmap an object?
Explain linear linked implementation of Stack and Queue?
Define a set?
Define primary clustering?
In what scenario, binary search can be used?
Write a program to reverse a link list.
What are the advantages and disadvantages of linked list?
When new data are to be inserted into a data structure?
Explain the common uses of threaded binary tree.
What is indexing an array?
What are lists?
