二叉树大量算法的实现 实现了三种非递归不借助栈不修改结点结构的遍历算法。参考性非常强-Binary Tree Algorithm to achieve a large number of three non-recursive without the aid of the stack does not modify the node structure of the traversal algorithm. Reference is very strong