Need help with my assignment, would appreciate it. 1. Which of the following pro
ID: 3879165 • Letter: N
Question
Need help with my assignment, would appreciate it.
1. Which of the following properties is true for a 2-4 tree?
additions only require a single rotation
All other answers are correct
every leaf node is always at the same level
every node has 3 data elements
2. In general, which statement is true?
2-4 trees are shorter than AVL trees
2-3 trees are shorter than AVL trees
2-4 trees are shorter than 2-3 trees
All the other answers are correct
3. The balance of a binary search tree may be compromised when __________.
A new node is added
Both a and c
A node is removed
None of the above
4. Given the binary search tree above, draw the tree after deleting the node with the value 10.
a
d
b
c
5. When there is an addition to a node’s right subtree that creates an unbalanced search tree, you can correct it with a(n) ___________.
reheap rotation
right rotation
left rotation
sift up
6. What is the worst-case performance of the add method in a binary search tree with linked nodes?
O(n2)
O(1)
O(log n)
O(n)
7. When adding an entry to a binary search tree, the search ends at a leaf if the entry is not already in the tree.
True
False
8. What is the worst-case performance of the remove method in a binary search tree with linked nodes?
O(n)
O(n2)
O(log n)
O(1)
9. Given a binary search tree with n nodes and height h, what is the maximum number of comparisons that each operation requires for the method remove?
O(n)
O(log h)
O(1)
O(h)
10. For best performance, when you add entries to a binary search tree, you should add them in sorted order.
True
False
a.additions only require a single rotation
b.All other answers are correct
c.every leaf node is always at the same level
d.every node has 3 data elements
Explanation / Answer
1)All other answers are correct
2)All the other answers are correct
3) Both a and c
4) Image NOT loading
5) 5. 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. (LL)
6) What is the worst-case performance of the add method in a binary search tree with linked nodes?
O(log n)
7. When adding an entry to a binary search tree, the search ends at a leaf if the entry is not already in the tree.
True
8. What is the worst-case performance of the remove method in a binary search tree with linked nodes?
O(log n )
9. Given a binary search tree with n nodes and height h, what is the maximum number of comparisons that each operation requires for the method remove?
Answer: O(h)
10. For best performance, when you add entries to a binary search tree, you should add them in sorted order.
False: because if we add in Sorted order, we will get Skewed Tree
Thanks, let me know if there is any concern.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.