Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 1613 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
What is a stable algorithm?
Differentiate between arraylist and vector.
In which matrix, we can use multilinked structures?
Is an arraylist an object?
How do you find the length of an arraylist?
How can avl tree be useful in all the operations as compared to binary search tree?
How do you sort large data?
Why would we use dynamically allocated arrays vs vectors?
Can we insert null in set?
How can someone display singly linked list from first to last?
What is advantage and disadvantage of linked list?
What is the minimization factor and time complexity of b-tree?
What are the differences between b tree and b+ tree?
What are the different types of collections?
Which interfaces are implemented by hashmap?
