Hashtables provide a more efficient implementation of symbol tables than binary search trees. This is because even though we could make a tree fit into an array using a mechanism like a heap, the

$[$ Select $]$ Linear Structure, branching structure, BST Rule, Heap Rule

requires us to

$[$ Select $]$ Link together the nodes, iterate through the nodes

$,$ regardless of if they are in a

$[$ Select $]$ linked or array, array, linked

data structure.