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
- 1848 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 data and data types?
Name two algorithms two find minimum spanning tree?
What are data members?
How is hashmap o 1?
Differentiate between the singly linked list and doubly linked list.
What is an ordered list?
What does isempty() member method determines?
What is a Breadth First Search? Give a few of its applications.
Is list an array?
Define ancestor and descendant ?
What is two-dimensional array?
How many types of data structure are there?
Windows 
