Our website is made possible by displaying online advertisements to our visitors. Please consider supporting us by whitelisting our website.

» C Programming Basic solved MCQs

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

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

» C Programming Basic solved MCQs

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

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

» C Programming Basic solved MCQs