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
- 1753 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 to show internal storage representation of data structure in RDBM?
Tell me what is quick sort?
How to find 3rd element from end in a linked list in one pass?
Write a program to reverse a link list.
Define a set?
What are the types of collision resolution strategies in open addressing?
How to find the duplicate in an array?
Describe the complexity of Quick Sort
What is a stable sorting algorithm?
Which is faster binary or linear search?
What is circular queue in data structure?
Can arraylist have null values?
Windows 
