In which tree, for every node the height of its left subtree and right subtree differ almost by one?

Question:

In which tree, for every node the height of its left subtree and right subtree differ almost by one?

A.

binary search tree

B.

avl tree

C.

threaded binary tree

D.

complete binary tree

Answer» b. avl tree

Note: The above multiple-choice question is for all general and Competitive Exams in India

What is Dequeue?

Question:

What is Dequeue?

A.

elements can be added from front

B.

elements can be added to or removed from either the front or rear

C.

elements can be added from rear

D.

none of the above

Answer» b. elements can be added to or removed from either the front or rear

Note: The above multiple-choice question is for all general and Competitive Exams in India

The worst case time complexity of AVL tree is better in comparison to binary search tree for

Question:

The worst case time complexity of AVL tree is better in comparison to binary search tree for

A.

search and insert operations

B.

search and delete operations

C.

insert and delete operations

D.

search, insert and delete operations

Answer» d. search, insert and delete operations

Note: The above multiple-choice question is for all general and Competitive Exams in India