LeetCode-94-Binary Tree Inorder Traversal 中序遍历二叉树

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
ans=[]
def inorderTraversal(self, root):
"""
:type root: TreeNode
:rtype: List[int]
"""
self.ans=[]
if root==None:return []
self.dfs(root)
return self.ans
def dfs(self, root):
"""
:type root: TreeNode
:rtype: List[int]
"""
if root.left==None and root.right==None:
self.ans.append(root.val)
return
if root.left!=None:
self.dfs(root.left)
self.ans.append(root.val)
if root.right!=None:
self.dfs(root.right)