leetcode94 Binary Tree Inorder Traversal

最新推荐文章于 2020-02-11 18:50:53 发布

钳子夹夹夹

最新推荐文章于 2020-02-11 18:50:53 发布

阅读量275

点赞数

分类专栏： LeetCode 文章标签： leetcode94 Binary Tr leetcode94

本文链接：https://blog.csdn.net/qq_31186409/article/details/50807903

版权

LeetCode 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

94. Binary Tree Inorder Traversal

Total Accepted: 113147 Total Submissions: 290357 Difficulty: Medium

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}".

AC代码：

/**
 * 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) {
        TreeNode* p = root;
        stack<TreeNode*> s;
        vector<int> vec;
        if (NULL == root)
            return vec;
        while (true) {
            if (NULL != p) {
                s.push(p);
                p = p->left;
                continue;
            }
            if (s.empty())
                break;
            p = s.top();
            s.pop();
            vec.push_back(p->val);
            p = p->right;
        }
    }
};