题目 分别按照二叉树先序，中序和后序打印所有的节点
一般写法
class Solution: def threeOrders(self , root ): # write code here def preorder(root): if not root: return [] return [root.val]+preorder(root.left)+preorder(root.right) def inorder(root): if not root: return [] return inorder(root.left)+[root.val]+inorder(root.right) def postorder(root): if not root: return [] return postorder(root.left)+postorder(root.right)+[root.val] return [preorder(root),inorder(root),postorder(root)]高明代码
class Solution: def threeOrders(self , root ): res_left=[] res_right = [] res_mid=[] def find(root): if root is None: return res_left.append(root.val) find(root.left) res_mid.append(root.val) find(root.right) res_right.append(root.val) find(root) return [res_left,res_mid ,res_right]题目地址
谨此表达一下我的瑞思拜
