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
- 1751 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
What does adt stands for?
What is binary tree used for?
How to compare Two Arrays?
What is the difference between hashset and hashmap?
Which data structure is used in arraylist?
List out a few of the applications that make use of Multilinked Structures?
Does hashmap maintain insertion order?
Does list maintain insertion order?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
What is fibonacci search?
What do you mean by free pool?
How do you assign an address to an element of a pointer array ?
Explain binary searching, Fibonacci search.
Explain singly linked list in short.
What are lists?
