A. All AVL trees are binary search trees, but not vice-versa B. There are four types of rotations to balance the AVL trees. C. Four types of traversals are possible on tree data structure D. The smallest elements in binary search is the right most element. E. The time complexity of binary sort algorithm is O (logn) choose the correct answer from the options given below:

Question

A. All AVL trees are binary search trees, but not vice-versa B. There are four types of rotations to balance the AVL trees.  C. Four types of traversals are possible on tree data structure  D. The smallest elements in binary search is the right most element.  E. The time complexity of binary sort algorithm is O (logn)  choose the correct answer from the options given below:

cdquestions Admin · Accepted Answer

The correct option is(B): A,B,C only

Answer

A,B,C,D and E only

Answer

Answer

Answer

B,C,D and E only

List I		List II
A.	Image	I.	text/icons
B.	unstructured data	II.	frames
C.	Messages	III.	metadata
D.	Video	IV.	pixels

The Correct Option is B

Solution and Explanation

Top Questions on Computer Literacy

Questions Asked in CUET PG exam