leetcode: (94) Binary Tree Inorder Traversal

最新推荐文章于 2022-06-30 15:29:15 发布

whu_zk

最新推荐文章于 2022-06-30 15:29:15 发布

阅读量278

点赞数

分类专栏： leetcode algorithms 文章标签： algorithms leetcode 二叉树

本文链接：https://blog.csdn.net/zk031/article/details/48231619

版权

leetcode algorithms 专栏收录该内容

40 篇文章 0 订阅

订阅专栏

【Question】

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.

方法一：非递归，栈实现

/**
 * Definition for a binary tree node.
 * 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) {
    stack<TreeNode*> sta1;
    vector<int> vec;
    TreeNode *cur;
    cur=root;
        while(cur!=NULL||!sta1.empty())
        {
            while(cur!=NULL)
            {
               sta1.push(cur);
               cur=cur->left;
            }
            if(!sta1.empty())
            {
               cur=sta1.top();
               sta1.pop();
               vec.push_back(cur->val);
               cur=cur->right;
            }
        }
        return vec;
    }
};