- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- An AVL tree is a self – balancing binary...

Q. |
## An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by |

A. | At least one |

B. | At most one |

C. | Two |

D. | At most two |

Answer» B. At most one |

View all MCQs in:
Data Structures (DS)

- Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?
- The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
- Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
- When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
- Which of the following is not the self balancing binary search tree?
- Which of the following is a self – balancing binary search tree?
- In which of the following self – balancing binary search tree the recently accessed element can be accessed quickly?
- Why to prefer red-black trees over AVL trees?
- A self – balancing binary search tree can be used to implement
- The minimum height of self balancing binary search tree with n nodes is

Login to Continue

It will take less than 2 minutes

Report MCQ