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
- 955 Views
- I also Faced
- E-Mail Answers
Answer / 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 |
Tell me about circular linked list?
What is queue in data structure?
State the merits of linear representation of binary trees?
How can you insert a node at the end of linked list?
What is the maximum size of array?
What do you mean by articulation point?
Which interfaces are implemented by abstractsequentiallist?
Does arraylist allow null values?
Define structure property in a heap?
What differences exist between hashmap and hashtable?
What is difference between concurrenthashmap and hashtable?
What is frozenset?
Windows 
