M

Mr. Dubey • 52.30K Points
Coach 

Q. An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by

(A) At least one
(B) At most one
(C) Two
(D) At most two
Correct : Option (B)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Find all the tuples having a temperature greater than ‘Paris’.

Q. A deviation from the specified or expected behavior that is visible to end-users is called:

Q. JUnit is a testing tool

Q. Can destuctors be private in C++?

Q. Computer operators

Q. What is not true about xml?

Q. Appear IQ, Mendix, Amazon Web Services (AWS) Elastic Beanstalk, Google App Engine and Heroku, are some of the example of providing services for:

Q. Management Information System deals with -----------------------------

Q. is used to show hierarchy in a pseudo code.

Q. Which of the following is true about constructors. They cannot be virtual.  They cannot be private. They are automatically called by new oper