二叉树的前序、中序、后序遍历

Kadima°

于 2021-01-22 17:42:00 发布

阅读量76

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/m0_45388819/article/details/112688645

版权

leetcode 专栏收录该内容

31 篇文章 0 订阅

订阅专栏

二叉树的前序、中序、后序遍历

在这里插入图片描述

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 * };
 */

class Solution {
public:
    /**
     * 
     * @param root TreeNode类 the root of binary tree
     * @return int整型vector<vector<>>
     */
    vector<vector<int> > threeOrders(TreeNode* root) {
        // write code here
        vector<int> preOrder;
        vector<int> inOrder;
        vector<int> postOrder;
        pre_in_post_order(root,preOrder,inOrder,postOrder);
        vector<vector<int>> result = {preOrder,inOrder,postOrder};

        return result;
    }
private:
    void pre_in_post_order(TreeNode* root,vector<int>& preOrder,vector<int>& inOrder, vector<int>& postOrder)
    {
        if(!root) return;
        preOrder.push_back(root->val);
        pre_in_post_order(root->left,preOrder,inOrder,postOrder);
        inOrder.push_back(root->val);
        pre_in_post_order(root->right,preOrder,inOrder,postOrder);
        postOrder.push_back(root->val);
    }    
};