An m-way search tree T is a tree in which all the nodes are of degree

1
Degree ≤ m
2
Degree = m + 1
3
Degree = m
4
Degree > m

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation