Editing Binary tree (section)

=== Encoding ordered trees as binary trees ===
There is a natural one-to-one correspondence between ordered trees and binary trees. It allows any ordered tree to be uniquely represented as a binary tree, and vice versa:

Let ''T'' be a node of an ordered tree, and let ''B'' denote ''T's'' image in the corresponding binary tree. Then ''B's'' ''left'' child represents ''T's'' first child, while the ''B's right'' child represents ''T'''s next sibling. 

For example, the ordered tree on the left and the binary tree on the right correspond:

[[Image:N-ary to binary.svg|400x240px|center|An example of converting an n-ary tree to a binary tree]]

In the pictured binary tree, the black, left, edges represent ''first child'', while the blue, right, edges represent ''next sibling''.

This representation is called a [[left-child right-sibling binary tree]].