- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Trees
- Given an empty AVL tree, how would you c...

Q. |
## Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations? |

A. | just build the tree with the given input |

B. | find the median of the set of elements given, make it as root and construct the tree |

C. | use trial and error |

D. | use dynamic programming to build the tree |

Answer» B. find the median of the set of elements given, make it as root and construct the tree |

View all MCQs in:
Data Structures (DS)

- 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
- What is an AVL tree?
- What is the maximum height of an AVL tree with p nodes?
- What maximum difference in heights between the leafs of a AVL tree is possible?
- 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___________.
- In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.
- In a binary search tree, which of the following traversals would print the numbers in the ascending order?
- Why to prefer red-black trees over AVL trees?
- A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?

Login to Continue

It will take less than 2 minutes

Report MCQ