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
- 1659 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 |
What is the time complexity of hashmap get () and put () method?
what is the biggest advantage of linked lists?
Which is faster binary or linear search?
What do you mean by hash function?
Which is the parent class of enumset class?
What do you mean by data and data structure?
What are the types of binary tree?
Which is the parent class of abstractqueue class?
What is height balanced tree?
Can value be null in treemap?
What is raid (redundant array of inexpensive disks)? Explain its level?
How to sequentially represent max-heap?
Windows 
