假设有这么一个二叉树如下:根据上述的二叉树,可以计算到:前序遍历结果:1,2,4,5,8,9,11,3,6,7,10中序遍历结果:4,2,8,5,11,9,1,6,3,10,7后序遍历结果:4,8,11,9,5,2,6,10,7,3,1二叉树的类实现classNode(object):definit(self,valueNone,leftNone,rightNone):self.valuevalueself.leftleftself.rightrightifname"main":treeNode(1,Node(2,Node(4),Node(5,Node(8),Node(9,leftNode(11)))),Node(3,Node(6),Node(7,leftNode(10))...