Binary Tree Inorder Traversal

来源：互联网发布：电子商务软件有哪些编辑：程序博客网时间：2024/06/04 23:49

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

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

   1    \     2    /   3

return [1,3,2].

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

非递归实现，栈的使用

0 0