Home

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. The number of possible ordered trees with three nodes A,B,C is?
  2. The memory address of fifth element of an array can be calculated by the formula
  3. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  4. Which of the following data structure is linear type?
  5. Which of the following data structure can't store the non-homogeneous data elements?
  6. When determining the efficiency of algorithm, the space factor is measured by
  7. When new data are to be inserted into a data structure, but there is no available space; this situation…
  8. Which of the following statement is false?
  9. Which of the following is two way list?
  10. The Average case occur in linear search algorithm
  11. ……………. Is a pile in which items are added at one end and removed from…
  12. To represent hierarchical relationship between elements, Which data structure is suitable?
  13. Arrays are best data structures
  14. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
  15. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
  16. The situation when in a linked list START=NULL is
  17. The term push and pop is related to the
  18. Which of the following data structure store the homogeneous data elements?
  19. Linked list are not suitable data structure of which one of the following problems ?
  20. Which of the following data structure cant store the non-homogeneous data elements?
  21. In linear search algorithm the Worst case occurs when
  22. If the values of a variable in one module is indirectly changed by another module, this situation is…
  23. Which of the following name does not relate to stacks?
  24. Finding the location of the element with a given value is:
  25. When determining the efficiency of algorithm the time factor is measured by
  26. Which if the following is/are the levels of implementation of data structure
  27. Which of the following algorithm design technique is used in the quick sort algorithm?
  28. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  29. Which of the following data structure is non linear type?
  30. The memory address of the first element of an array is called