| 11. | Beam search uses breadth-first search to build its search tree.
|
| 12. | The procedure cuts the to-be-evaluated search tree effectively both in depth and in width.
|
| 13. | Common applications for ternary search trees include spell-checking and auto-completion.
|
| 14. | Search trees are often used to implement an associative array.
|
| 15. | Single access keys are closely related to decision trees or self-balancing binary search trees.
|
| 16. | Were now added to the program, then the search tree would contain an infinite branch.
|
| 17. | Unlike most other self-balancing search trees, scapegoat trees are entirely flexible as to their balancing.
|
| 18. | The two major approaches to implementing dictionaries are a hash table or a search tree.
|
| 19. | The backtracking algorithm traverses this search tree depth-first order.
|
| 20. | Such a data structure is known as a treap or a randomized binary search tree.
|
