Quiz
0. AVL Tree Visualization
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (16)
1An AVL tree is an example of a balanced tree.
- ATrue
- BFalse
2When the Avl is in a left left case which of these steps should you take
to correct the height of the tree ?- AA) Right
- BB) left
- CC) Left Right
- DD) Rgiht left
3Why is a balance condition imporant in binary search trees like AVL?
- AIt ensures that the depth of the tree is O(logN)
- Bnone of the above
4What is a "balanced" binary tree?
- AA) A tree whose leaves are all on the same depth
- BB) A complete and full tree
- CC) A tree whose left and right subtrees differ by at most 1 in depth
- DD) A binary tree cannot be balanced
5What’s the average case for search? Worst case?
- AO(log n); O(log n)
- Bnone of the above
6What is an AVL tree?
- AA) a tree with lots of leaves
- BB) a self balancing binary tree
- CC) there is no such thing
- DD) a tree with the parent being the smallest value
7When inserting into an AVL tree, the first step is to insert a node in its proper place according to BST rules.
After BST insertion however, the tree is not guaranteed to be an AVL tree. What is the next step in the algorithm?- AA. if the new node is a left leaf, rotate left
- BB. update the height and determine the balance of the tree recursively
- CC. if the new node is a right leaf, rotate right
- DD. deconstruct the tree and build it again from scratch
8What makes AVL trees different from Binary Search Trees?
- AIn an AVL tree every node in the tree, the height of the left and right subtrees can differ by at most one.
- Bnone of the above
9What is an AVL tree visualization?
- AA. an AVL tree is a self-balancing binary search tree.
- BB. an AVL tree is a non-balancing binary search tree.
- CC. an AVL tree is a back-balancing binary search tree.
- DD. an AVL tree is a front-balancing binary search tree.
10An Adelson-Velskii Landis (AVL) tree is a self-balancing Binary Search Tree(BST) that maintains it's height to be O(log N) when having N vertices in the AVL tree.
- ATrue
- BFalse
11When rotating an AVL tree which of the following are a case where you would need to rotate?
- AA. left,left
- BB. left,right
- CC. right,right
- DD. right,left
- EE. All of the above
12In average case, what is the efficiency of insertion of an AVL tree
- AA. logn
- BB. nlogn
- CC. n
- DD. n2
13What do AVL trees do?
- AThey automatically readjust to keep the tree more balanced with a
lower height. This reduces the worst-case scenario of searching. - Bnone of the above
- AThey automatically readjust to keep the tree more balanced with a
14What is the worst case possible height of AVL tree?
- AA.n
- BB.n^2
- CC.1.44 log n
- DD.n+2
15What is the term for AVL tree balancing?
- Azig-zag
- Bnone of the above
16What is the biggest height difference an AVL tree can have without rotating?
- AAt most the difference can be a height of 1.
- Bnone of the above
Information
- Description
- Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU
- Author
- Mena Sargios
- Language
- English
- Views
- 829
- Tags
- Rating
- No ratings yet Rate this quiz