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
- 1615 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 |
How does hashset maintain order?
What is the slowest sorting algorithm?
Is hashset thread safe?
What is the default size of an arraylist?
Calculate the address of a random element present in a 2d array, given base address as ba.
What is a list in data structure?
Why is quicksort unstable?
What does each entry in the link list called?
Which data structures are applied when dealing with a recursive function?
Define disjoint set adt?
How do I sort hashset?
Which is better hashmap or arraylist?
Windows 
