LeetCode-Binary Tree Inorder Traversal

最新推荐文章于 2026-06-03 13:06:27 发布

原创最新推荐文章于 2026-06-03 13:06:27 发布 · 443 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode #Binary Tree Inorder

Cracking LeetCode 同时被 3 个专栏收录

152 篇文章

订阅专栏

Tree

26 篇文章

订阅专栏

Recursion

24 篇文章

订阅专栏

本文深入探讨了在数据结构中如何使用递归和迭代方法进行二叉树的中序遍历，并通过具体实例展示了两种方法的实现过程，旨在帮助读者理解不同算法策略在解决相同问题时的差异和适用场景。

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.

OJ's Binary Tree Serialization:

The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.

Here's an example:

The above binary tree is serialized as "{1,2,3,#,#,4,#,#,5}".

Solution:

Code:

<span style="font-size:14px;">/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> inorderTraversal(TreeNode *root) {
        vector<int> result;
        if (root == NULL) return result;
        stack<TreeNode *> stk;
        stk.push(root);
        while (!stk.empty()) {
            root = stk.top();
            stk.pop();
            if (root->left == NULL && root->right == NULL) {
                result.push_back(root->val);
                continue;
            }
            TreeNode *leftNode = root->left;
            TreeNode *rightNode = root->right;
            root->left = NULL;
            root->right = NULL;
            if (rightNode)
                stk.push(rightNode);
            stk.push(root);
            if (leftNode)
                stk.push(leftNode);
        }
        return result;
    }
};</span>