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
- 924 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 |
When will you sort an array of pointers to list elements, rather than sorting the elements themselves?
What are some of the best practices relating to the java collection framework?
What is the bucket size, when the overlapping and collision occur at the same time?
Does hashmap maintain insertion order?
What is data type explain?
What is a data structure?
Write an algorithm that counts number of nodes in the circular linked list
What is array traversing?
How do stacks work?
What data structure underlies a python list?
Does treeset allow null values?
What is the time complexity of arrays sort?
Windows 
