二叉树算法的实现

遍历是对树的一种最基本的运算，所谓遍历二叉树，就是按一定的规则和顺序走遍二叉树的所有结点，使每一个结点都被访问一次，而且只被访问一次。由于二叉树是非线性结构，因此，树的遍历实质上是将二叉树的各个结点转换成为一个线性序列来表示。-Binary tree traversal algorithm is a basic tree operations, so-called binary tree traversal, traveled according to certain rules and order of binary tree nodes, each node is visited once, and only be accessed once . Since the binary tree is a non-linear structure, therefore, the traversal of the tree each node of the binary tree is substantially converted into a linear sequence.