Question

Binary search tree and hash table are examples of which data structure

Answer 1

A binary search tree is for sorting an ordered collection..
Hash table is for storing an unordered collection..

Answer 2

Answer:

The answer to the given is explained in the explanation.

Explanation:

BST is considered to be a node-organized data structure like a linked list. These nodes are either null or have links (links) to other nodes. These "other" nodes are child nodes called left and right nodes. Nodes are important. This value determines the location of the BST.

As with the linked list, each node refers to only one other node, which is its parent (except the root node).

A hash table sometimes referred to as a hash map, is a form of data structure that uses an abstract data type called an associative array or dictionary to map keys to values.  In order to locate the desired value inside an array of buckets or slots, a hash table uses a hash function to produce an index, sometimes referred to as a hash code.

#SPJ2