Explain external hashing, b-trees, and traversals. 3-5 sentences per

In external hashing the hash table is in disk where each slot of the page table holds multiple entries which refers to pages on the disk organised in the form of buckets.

B-trees are self balancing trees which contains sorted data and allows insertion, deletion, traversals

Traversal is the process of visiting the nodes of the tree data structure.

Explanation:

External hashing is different from internal hashing and it refers to concepts in database management systems. Internal hashing stores only single record maintained in page table format, whereas external hashing holds multiple entries.

B-trees are generalisation of binary trees where it can have more than 2 children.

Traversal of trees helps in insertion, deletion, modification of nodes in tree data structure

no backup memory