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
- 1719 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 the use of data structure in real life?
How can we delete any specific node from the linked list?
What is array sort?
Write an algorithm to show the reverse of link list?
Which type of sorting is best?
What is rule regarding overriding equals and hascode method?
What are the advantages and disadvantages of linked list over array?
Explain binary searching, Fibonacci search.
Write a program to reverse a single linked list.
Is bubble sort slow?
How will you reverse Linked List.
What is a map programming?
Windows 
