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
- 1715 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 the structure of an array?
Why null is not allowed in treemap?
State the merit of linked representation of binary trees?
What is a sorting algorithm in data structure?
Which language is best for data structures?
Which is the parent class of printerstatereasons class?
List out the advantages of using a linked list?
Explain the terms base case, recursive case, binding time, run-time stack and tail recursion.
Construct a doubly linked list using a single pointer in each node?
What do you mean by quadratic probing?
Why is arraylist faster than linkedlist?
What do you mean by garbage collection?
What does the term sorting refer to?
Why concurrenthashmap is fail safe?
Which is the fastest sorting?
