Q. |
## 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 |

Answer» A. avl tree |

View all MCQs in:
Data Structure (DS)

- A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
- The property of binary tree is
- To perform level-order traversal on a binary tree, which of the following data structure will be required?
- In general, the binary search method needs no more than ……………. comparisons.
- A graph is a tree if and only if graph is
- In ……………, search start at the beginning of the list and check every element in the list.
- Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?
- …………………. Is a directed tree in which outdegree of each node is less than or equal to two.
- Which data structure is used in breadth first search of a graph to hold nodes?
- The number of comparisons done by sequential search is ………………

We want to make our service better for you. Please take a moment to fill out our survey.

Take SurveyLogin to Continue

It will take less than 2 minutes

Report MCQ