Home

What is the correct answer?

4

A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……

A. AVL tree

B. Red-black tree

C. Lemma tree

D. None of the above

Correct Answer :

A. AVL tree


Related Questions

Which of the following is non-liner data structure? When determining the efficiency of algorithm, the space factor is measured… Which of the following statement is true ? Which of the following data structure cant store the non-homogeneous data… Which data structure is used in breadth first search of a graph to hold… Which of the following is not the required condition for binary search… When determining the efficiency of algorithm the time factor is measured… The complexity of Bubble sort algorithm is The term push and pop is related to the Finding the location of the element with a given value is: Which of the following name does not relate to stacks? Given two sorted lists of size m and n respectively.The number of comparisons… The number of possible ordered trees with three nodes A,B,C is? Which of the following data structure can't store the non-homogeneous… Linked lists are best suited Which data structure allows deleting data elements from and inserting… Which of the following data structure is linear data structure? The operation of processing each element in the list is known as Herder node is used as sentinel in ____ A binary search tree whose left subtree and right subtree differ in hight… For an algorithm the complexity of the average case is The complexity of merge sort algorithm is The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending… Which of the following is true about the characteristics of abstract data… ……………. Is a pile in which items are added… Inserting an item into the stack when stack is not full is called _______… Binary search algorithm can not be applied to Which of the following data structure is linear type? The Average case occur in linear search algorithm Merge sort uses ?