二叉树的后序遍历

最新推荐文章于 2024-09-09 15:49:20 发布

_番茄小西瓜_

最新推荐文章于 2024-09-09 15:49:20 发布

阅读量187

点赞数

本文链接：https://blog.youkuaiyun.com/going_fighting/article/details/78133841

版权

给出一棵二叉树，返回其节点值的后序遍历。

您在真实的面试中是否遇到过这个题？

Yes

样例

给出一棵二叉树 {1,#,2,3},

返回 [3,2,1]

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */


class Solution {
public:
    /*
     * @param root: A Tree
     * @return: Postorder in ArrayList which contains node values.
     */
    vector<int> postorderTraversal(TreeNode * root) {
        vector<int> temp;
        if(root == NULL)
            return temp;
        posterder(root,temp);
        return temp;
        // write your code here
    }
    
    void posterder(TreeNode *root,vector<int> &path)
    {
        if(root != NULL)
        {
            posterder(root->left,path);
            posterder(root->right,path);
            path.push_back(root->val);
        }
        if(root == NULL)
          return ;
    }
};