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

Please do not use chat terms. Example: avoid using "grt" instead of "great".

You can do it
  1. Which of the following is not the part of ADT description?
  2. The memory address of fifth element of an array can be calculated by the formula
  3. The elements of an array are stored successively in memory cells because
  4. Two main measures for the efficiency of an algorithm are
  5. Finding the location of the element with a given value is:
  6. Which of the following data structure cant store the non-homogeneous data elements?
  7. Which if the following is/are the levels of implementation of data structure
  8. The number of possible ordered trees with three nodes A,B,C is?
  9. The situation when in a linked list START=NULL is
  10. The Average case occur in linear search algorithm
  11. The complexity of merge sort algorithm is
  12. ______ is very useful in situation when data have to stored and then retrieved in reverse order.
  13. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  14. When new data are to be inserted into a data structure, but there is no available space; this situation…
  15. The complexity of linear search algorithm is
  16. For an algorithm the complexity of the average case is
  17. Merge sort uses ?
  18. Which of the following data structure is non linear type?
  19. When determining the efficiency of algorithm, the space factor is measured by
  20. Linked lists are best suited
  21. Which of the following data structure can't store the non-homogeneous data elements?
  22. Which of the following is not the required condition for binary search algorithm?
  23. The complexity of Binary search algorithm is
  24. Each array declaration need not give, implicitly or explicitly, the information about
  25. Herder node is used as sentinel in ____
  26. Linked list are not suitable data structure of which one of the following problems ?
  27. The operation of processing each element in the list is known as
  28. _______ level is where the model becomes compatible executable code
  29. When determining the efficiency of algorithm the time factor is measured by
  30. Which of the following algorithm design technique is used in the quick sort algorithm?