标签:color help ret order 分享 题目 ges end src
题目如下:
Python代码:
def inorderTraversal(self, root): res = [] self.helper(root, res) return res def helper(self, root, res): if root: self.helper(root.left, res) res.append(root.val) self.helper(root.right, res)
LeetCode(94)Binary Tree Inorder Traversal
标签:color help ret order 分享 题目 ges end src
原文地址:http://www.cnblogs.com/CQUTWH/p/7155073.html