A splay BST ensures that insertion does not create long paths by: A) moving the

Question

A splay BST ensures that insertion does not create long paths by:
A) moving the inserted element to the root.
B) leaving the inserted element in place.
C) bringing all recently accessed elements closer to the root.
D) splitting nodes after an insert.
E) none of the above.

2.
Hashing is a:
A) randomized search.
B) BST implementation.
C) trie search.
D) key-indexed search.
E) radix search.

3.
An advantage of TSTs is that they:
A) do not require any extra space.
B) do not require complete keys.
C) perform partial-match searches.
D) can search just one tree branch.
E) all of the above.

4.
A B tree is a:
A) red-black tree.
B) randomized binary search tree.
C) multiway balanced tree.
D) Patricia trie.
E) modular hashing function.

5.
A symbol table's basic operation is:
A) remove.
B) insert.
C) join.
D) sort.
E) none of the above.

6.
In a trie, a key is associated with a:
A) node.
B) root.
C) path.
D) leaf.
E) forest.

Explanation / Answer

1 . A splay BST ensures that insertion does not create long paths by: Ans : A) moving the inserted element to the root. 2.Hashing is a: Ans : D) key-indexed search. 3. An advantage of TSTs is that they: Ans : C) perform partial-match searches. 4) A B tree is a: Ans : C) multiway balanced tree. 5) A symbol table's basic operation is: Ans : B) insert. 6) In a trie, a key is associated with a: Ans : A) node.

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.