中序遍历是先遍历左子树,在自身,再遍历右子树,
非递归实现的方法,一直遍历左节点,然后出栈,在遍历右节点
# 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): def inorderTraversal(self, root): """ :type root: TreeNode :rtype: List[int] """ if root ==None: return [] stack=[] result=[] while (len(stack)!=0 or root!=None): while root!=None: stack.append(root) root =root.left if len(stack)!=0: root=stack.pop() result.append(root.val) root =root.right return result
原文地址:https://www.cnblogs.com/hit-joseph/p/9452509.html
时间: 2024-10-30 05:34:09