leetcde94 二叉树的中序遍历 python

给定一个二叉树，返回它的中序 遍历。
示例:
输入: [1,null,2,3]
1

2
/
3

输出: [1,3,2]

方法1：
递归

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

class Solution:
    def _inorderReaversal(self,res,root):
        if not root:
            return []
        self._inorderReaversal(res,root.left)
        res.append(root.val)
        self._inorderReaversal(res,root.right)
        
    
    
    def inorderTraversal(self, root):
        """
        :type root: TreeNode
        :rtype: List[int]
        """
        res=[]
        self._inorderReaversal(res,root)
        return res

方法二
堆栈

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

class Solution:
    def inorderTraversal(self, root):
        """
        :type root: TreeNode
        :rtype: List[int]
        """
        stack=[]
        res=[]
        node=root
        while node or stack:
            while node:
                stack.append(node)
                node=node.left            
            node=stack.pop()
            res.append(node.val)
            node=node.right
        return res