本文共 479 字，大约阅读时间需要 1 分钟。
This is the third article on binary tree operations. For other topics on binary tree, please refer to:
Left-Right representation of a binary tree is standard representation where every node has a pointer to left child and another pointer to right child.
Down-Right representation is an alternate representation where every node has a pointer to left (or first) child and another pointer to next sibling. So siblings at every level are connected from left to right.
- See more at:转载地址：http://qfpvb.baihongyu.com/