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
- 1849 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
Is bucket sort a comparison sort?
Define linked list data structure.
How to create your own data structure in java?
What is precision?
Define balance factor of a node in avl tree?
Traverse the given tree using Inorder, Preorder and Postorder traversals. Inorder : D H B E A F C I G J Preorder: A B D H E C F G I J Postorder: H D E B F I J G C A
Is it necessary to sort a file before searching a particular item ?
What is a hash index?
What are different types of sorting techniques?
What is the default size of arraylist?
Mention some drawbacks of the linked list.
Can you make an arraylist of arrays?
Which sorting technique is faster?
Can arraylist contain duplicates?
What is data type and its types?
