## Quick Reference

**left** and **right subtrees** of the node. At level *h* of a binary tree there is a maximum of 2* ^{h}* nodes. A binary tree of depth

*d*thus has at most (2

*–1) nodes and one with*

^{d+1}*n*nodes has a minimum depth of log

_{2}

*n*.

The term binary tree is also used to describe any (ordered) tree of degree two.

**Binary-tree representation**. A tree and its binary representation

**From:**
binary tree
in
A Dictionary of Computing »

*Subjects:*
Computing.

## Related content in Oxford Index

##### Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.