leetcode 二叉树中序遍历的递归和非递归实现

来源：互联网发布：ubuntu接口配置ip地址编辑：程序博客网时间：2024/06/09 15:48

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 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) {        vector<int> vec;        inOrder(root, vec);        return vec;    }        /*    void inOrder(TreeNode *root, vector<int> &path)    {        //递归写法        if (root)        {            inOrder(root->left, path);            path.push_back(root->val);            inOrder(root->right, path);        }    }    */    //非递归写法    void inOrder(TreeNode *root, vector<int> &path)    {        stack<TreeNode *> TreeNodeStack;        while (root != NULL || !TreeNodeStack.empty())        {            while(root != NULL)            {                TreeNodeStack.push(root);                root = root->left;            }            if (!TreeNodeStack.empty())            {                root = TreeNodeStack.top();                TreeNodeStack.pop();                path.push_back(root->val);                root = root->right;            }        }    }};

0 0