I would like to describe a bijection between binary trees and plane trees. A binary tree has a root node and each node of the tree has at most 2 children (left and right). A plane tree has a root node and the children of each node are ordered from left to right. Can someone enlighten me on this? Thanks!
Bijection between binary trees and plane trees?
3
$\begingroup$
combinatorics
trees
-
2There is a way of encoding n-ary trees into binary: the left is a son and the right is a brother. Are you looking along those lines, could you provide some context? – 2012-12-04
-
0@dtldarek: Indeed. Left-child right-sibling binary tree, in wikipedia terminology. Can you make that an answer, so we can +1 it? – 2012-12-04