树的四种遍历方式，中叙，前序，后序和按层遍历算法，前三个用递归很好实现，最后一个复杂点。-tree traversal of the four, China and Syria, the former sequence after sequence and by layer traversal algorithm, the former three Recursive properly achieved, Finally a complex point.