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
- 1619 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 |
Differentiate between hashset and hashmap.
Why sorting algorithms are important?
Does treemap allow null values?
What are the scenarios in which an element can be inserted into the circular queue?
What is unbounded queue?
What is bubble sort technique?
Write the algorithm for converting infix expression to postfix expression?
What is complexity of quicksort?
What do you mean by overflow and underflow?
What is a threaded binary tree? Explain its operation with example?
What is linked list ?
When will you use array over arraylist?
Windows 
