94. Binary Tree Inorder Traversal Leetcode Python

关注

原创最新推荐文章于 2025-05-07 13:43:52 发布 938 阅读 AI 写同款· GEO 优化 ›

S/4HANA Private Cloud 与 On-Premise 的 Key User Custom Fields 运输与升级避坑指南本文探讨了SAP S/4HANA Cloud Private Edition和On-Premise系统中Key User Custom Fields的管理要点。文章指出，Custom Fields涉及元数据生成、对象一致性、传输治理等完整链路，操作不当会导致字段丢失或升级失败。关键建议包括：使用ATO Fiori App管理扩展项与传输绑定，配置正确的job user权限，避免在多系统并行开发同一字段。特别强调升级时需执行CFD_REGENERATE_IN_ONPREMISE报表，并通过标准传输机制推进变更阅读详情

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

For example:
Given binary tree {1,#,2,3},

return [1,3,2].

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

这道题目主要考察inorder traverse, 题目很简单，但是也要考虑traverse 和iterative 的方法。其中iterative 的方法参考了http://jelices.blogspot.com/2014/06/leetcode-python-binary-tree-inorder.html

首先是traversal

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

class Solution:
    # @param root, a tree node
    # @return a list of integers
    def inorder(self,root,solution):
        if root:
            self.inorder(root.left,solution)
            solution.append(root.val)
            self.inorder(root.right,solution)
    def inorderTraversal(self, root):
        solution=[]
        self.inorder(root,solution)
        return solution

iterative 的方法

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

class Solution:
    # @param root, a tree node
    # @return a list of integers
    def inorderTraversal(self, root):
        stack=[]
        solution=[]
        node=root
        while node or len(stack)>0:
            if node!=None:
                stack.append(node)
                node=node.left
            else:
                node=stack.pop()
                solution.append(node.val)
                node=node.right
        return solution