(definition)

**Definition:**
(1) The *height* of a *tree*. (2) The number of *children* of the *root* of a *binomial tree*. (3) The maximum number of children of *nodes* in a *B-tree*. (4) The number of data streams, usually denoted ω, in a *multiway merge*.

**See also**
*total order*, *partial order*.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.

HTML page formatted Mon Feb 2 13:10:40 2015.

Cite this as:

Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999 and Paul E. Black, "order", in
*Dictionary of Algorithms and Data Structures* [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/order.html