Leetcode-94. Binary Tree Inorder Traversal

最新推荐文章于 2022-08-13 11:53:57 发布

Fantastic_HQ

最新推荐文章于 2022-08-13 11:53:57 发布

阅读量89

点赞数

分类专栏： Leetcode 文章标签： leetcode 数据结构和算法

本文链接：https://blog.csdn.net/qq_27445903/article/details/108282855

版权

Leetcode 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

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

Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [1,3,2]

/**
 * 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 {
#define MaxSize 100
typedef struct Stack{
    TreeNode* data[MaxSize];
    int top;
}Stack;

public:
    vector<int> inorderTraversal(TreeNode* root) {
         vector<int> vector;
    if (root == NULL) {
        return vector;
    }
    Stack stack;
    stack.top = -1;
    
    //Root gets into stack
    stack.data[++(stack.top)] = root;
    TreeNode* q;
    int visit = 0;
    
    while (stack.top != -1) {
        q = stack.data[stack.top];
        if (q->left && visit == 0) {
            stack.data[++(stack.top)] = q->left;
        }else{
            q = stack.data[(stack.top--)];
            visit = 1;
            vector.push_back(q->val);
            if (q->right) {
                stack.data[++(stack.top)] = q->right;
                visit = 0;
            }
        }
    }
    return vector;
    }
};