Every tree and forest can be represented by a binary tree using a left-leftmost-child right next-Sibling representation; that is, the leftmost child of a node in the original tree or forest becomes the left child of that node in the binary tree, and its next sibling is the right child of that node.