solve 1-10 Problems 1-10 (10 total points): Match an answer on the right to an i
ID: 3579630 • Letter: S
Question
solve 1-10
Problems 1-10 (10 total points): Match an answer on the right to an item on the left. Choose the best answer.
_______Stack
a.log (n)
________BST
b.occurs when two or more items have the same key
_______Hash Table
c.root
_______Hash function
d.database
_______inorder successor
e.FIFO
_______inorder predecessor
f.leftmost child of rightchild of node to delete
_______Queue
g.Every node has at most 2 children
_______Access point
h.rightmost child of leftchild of node to delete
_______BST Search runtime
i.mapping
_______collision
j.LIFO
_______Stack
a.log (n)
________BST
b.occurs when two or more items have the same key
_______Hash Table
c.root
_______Hash function
d.database
_______inorder successor
e.FIFO
_______inorder predecessor
f.leftmost child of rightchild of node to delete
_______Queue
g.Every node has at most 2 children
_______Access point
h.rightmost child of leftchild of node to delete
_______BST Search runtime
i.mapping
_______collision
j.LIFO
Explanation / Answer
Stack -> j.LIFO
BST -> a.log(n)
Hash Table -> d.database
Hsh Function -> Mapping
inorder successor -> h.rightmost child of leftchild of node to delete
inorder predecessor -> f.leftmost child of rightchild of node to delete
Queue -> e.FIFO
Access point -> g.Every node has at most 2 children
BST Search runtime -> c.root
collision -> b.occurs when two or more items have the same key
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.