Chapter 11 - Multiway Search Trees

Every internal node of an M-way search tree consists of pointers to M sub-trees and contains how many keys?

• M

• M−1

• 2

• M+1

Every node in a B tree has at most ________ children.

• M
• M-1

• 2

• M+1

Which data structure is commonly used to store a dictionary?

• Binary Tree

• Splay tree

• Trie

• Red black tree

In M-way search tree, M stands for

• Internal nodes

• External nodes

• Degree of node

• Leaf nodes

In best case, searching a value in a binary search tree may take

• O(n)

• O(n log n)

• O(log n)

• O(n²)

All leaf nodes in the B tree are at the same level.

• True

• False

A B+ tree stores data only in the i-nodes.

• True

• False

B tree stores unsorted data.

• True

• False

Every node in the B-tree has at most (maximum) m−1 children.

• True

• False

The leaf nodes of a B tree are often linked to one another.

• True

• False