An m-ary tree in computer science is defined as a collection of nodes normally represented hierarchically in the following manner.
A typical representation of m-ary tree implements an array of m references (or pointers) to store children (Note that m is an upper bound on number of children).
An m-way search tree
a. is empty or
b. consists of a root containing b (1<=b<m) keys, kb, and a set of sub-trees, Ta, (a = 0..b), such that
Image of m-ary Tree
The height of a complete m-ary tree associated with n nodes is ceiling(logmn).
A B-tree of order m is an m-way tree in which
a. all leaves should be on the same level and
b. all nodes except for the root and the leaves have minimum m/2 children and maximum m children. The root has minimum 2 children and maximum m children.