B Trees Indexing Multiple Choice Questions (MCQ) PDF Download

MCQ 1: The special node in the tree structure which has many child nodes and one parent node is called

1. descendant nodes
2. root node
3. leaf node
4. search node

MCQ 2: The tree structure diagram in which the pointers of data are stored at the leaf nodes of diagram is classified as

1. b tree
2. b⁺ tree
3. b² tree
4. B^* tree

MCQ 3: In tree structure, the node which is free of child nodes is called

1. descendant nodes
2. root node
3. leaf node
4. search node

MCQ 4: The search value which is present on each node in search tree diagram of order 'p' is as

1. p - 1
2. p - 2
3. p + 1
4. p + 2

MCQ 5: In tree structure diagrams, the non leaf node is called

1. search node
2. descendant nodes
3. external node
4. internal node