In: Computer Science
Computer Science Multiple Choice: Please complete all 5
questions in exchange for an immediate upvote. Incomplete...
Computer Science Multiple Choice: Please complete all 5
questions in exchange for an immediate upvote. Incomplete answers
will be downvoted so please move on if they aren't worth your time.
Thank you!
- A node that is the root of a balanced tree is called a(n) _____
node.
- balanced
- master
- search
- AVL
- When there is an addition to a node’s right subtree that
creates an unbalanced search tree, you can correct it with a(n)
- left rotation
- right rotation
- reheap
- sift up
- What type of rotation do you need to rebalance an AVL tree if
the addition that unbalanced the tree occurred in the left subtree
of node N, the unbalanced node’s left child?
- left rotation
- right rotation
- right-left rotation
- left-right rotation
- What type of rotation do you need to rebalance an AVL tree if
the addition that unbalanced the tree occurred in the right subtree
of node N, the unbalanced node’s left child?
- left rotation
- right rotation
- right-left rotation
- left-right rotation
- What type of rotation do you need to rebalance an AVL tree if
the addition that unbalanced the tree occurred in the left subtree
of node N, the unbalanced node’s right child?
- left rotation
- right rotation
- right-left rotation
- left-right rotation