（python）递归+非递归的二叉树前序、中序、后序遍历实现

补充一下二叉树三种遍历代码实现，同样是纯coding，写熟完事，思路就不赘述。

一.二叉树构建

假设下图是我们的树：

构建：

class TreeNode(object):
    def __init__(self,value=None,left=None,right = None):
        self.value = value
        self.left = left
        self.right = right
    def visit_value(self):
        print(self.value,end=' ')

node1 = TreeNode(1)
node2 = TreeNode(2)
node3 = TreeNode(3)
node4 = TreeNode(4)
node5 = TreeNode(5)
node6 = TreeNode(6)
node7 = TreeNode(7)
node1.lef