2018-05-11 Leetcode Tree Traversals (Inorder, Preorder and Postorder) Object: Binary Treetree12 Depth First Traversals: (a) Inorder (Left, Root, Right) : 4 2 5 1 3 (b) Preorder (Root, Left, Right) : 1 2 4 5 3 (c) Postorder (Left, Right, Root) : 4 5 2 3 1 Newer python程序运行时间 Older String Manipulation