leetcode: 树 94. Binary Tree Inorder Traversal

题目

Given a binary tree, return the inorder traversal of its nodes' values.

Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [1,3,2]

Follow up: Recursive solution is trivial, could you do it iteratively?

思路

          题目中说，用递归的方法太繁杂，希望用迭代的方法。那就用栈

          遍历的顺序可以看出是 ：左-根-右。所以用栈，把root 压入，遍历完 left后，再从栈中读出root，紧接着遍历 right。

# 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: TreeNode) -> List[int]:
        # left root right
        if root == None:
            return []
        
        ans = []
        stack_root = []
        while (1):
            # 遍历左侧
            while(1):
                while root.left :
                    stack_root.append(root)
                    root = root.left
                ans.append(root.val)
                if root.right:
                    root = root.right
                else:
                    break
            
            # 遍历根和右侧
            if len(stack_root)>0:
                while root.right == None and len(stack_root)>0:
                    root = stack_root.pop()
                    ans.append(root.val)
                if root.right:
                    root = root.right
                else:
                    break
            else:
                break
        return ans