LeetCode 二叉树 | 144. Binary Tree Preorder Traversal

最新推荐文章于 2024-07-19 19:25:43 发布

rical730

最新推荐文章于 2024-07-19 19:25:43 发布

阅读量168

点赞数

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

本文链接：https://blog.csdn.net/rical730/article/details/59486715

版权

LeetCode 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

/*
 * Leetcode144. Binary Tree Preorder Traversal
 * Funtion: Given a binary tree, return the preorder traversal of its nodes' values.
 * Author: LKJ
 * Date:2016/7/26
*/
#include <iostream>
#include <vector>

using namespace std;


struct TreeNode {
    int            val;
    TreeNode*    left;
    TreeNode*    right;
    TreeNode(int x): val(x), left(NULL),right(NULL) {}
};

void pre_order(vector<int>& pre, TreeNode* root){
    if(root != NULL){
        pre.push_back(root->val);
        pre_order(pre,root->left);
        pre_order(pre,root->right);
    }
}

class Solution {
public:
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> pre;
        pre_order(pre, root);//用递归给出前序序列
        return pre;
    }
};



int main(){
    //int myin;
    //int myout;
    //Solution SA;
    //cout << "Please Enter" << endl;
    //cin >> myin;
    //myout = SA.singleNumber(myin);
    //cout << myout << endl;
    //cout << getFristBit(1) << endl;
    return 0;
}