leetcode--144--二叉树的前序遍历

给你二叉树的根节点 root ，返回它节点值的 前序 遍历。

#include <iostream>
#include <vector>

using namespace std;

/// 144. Binary Tree Preorder Traversal
/// https://leetcode.com/problems/binary-tree-preorder-traversal/description/
/// 二叉树的前序遍历
/// 时间复杂度: O(n), n为树的节点个数
/// 空间复杂度: O(h), h为树的高度

/// 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> preorderTraversal(TreeNode* root) {

        vector<int> res;
        __preorderTraversal(root, res);
        return res;
    }

private:
    void __preorderTraversal(TreeNode* node, vector<int> &res){

        if(node){
            res.push_back(node->val);
            __preorderTraversal(node->left, res);
            __preorderTraversal(node->right, res);
        }
    }
};

void deallocate_tree(TreeNode* t){
    if(t != NULL){
        deallocate_tree(t->left);
        deallocate_tree(t->right);
        delete t;
    }
}
TreeNode* cons_tree(int e, TreeNode* l, TreeNode* r){
    TreeNode* tmp;
    tmp = new TreeNode(e);
    tmp->left = l;
    tmp->right = r;
    return tmp;
}

TreeNode* ordered_insertion_tree(int e, TreeNode* t){
    // BST
    if (t == NULL) {
        return cons_tree(e, NULL, NULL);
    } else if (e < t->val) {
        t->left = ordered_insertion_tree(e, t->left);
        return t;
    } else {
        t->right = ordered_insertion_tree(e, t->right);
        return t;
    }
}

int main() {
    TreeNode* t = NULL;
    t = ordered_insertion_tree(15, t);
    t = ordered_insertion_tree(20, t);
    t = ordered_insertion_tree(6, t);
    t = ordered_insertion_tree(1, t);
    t = ordered_insertion_tree(4, t);
    t = ordered_insertion_tree(18, t);
    t = ordered_insertion_tree(9, t);
    t = ordered_insertion_tree(50, t);
    vector<int> bst = Solution().preorderTraversal(t);
    cout<< bst.size() <<endl;
    for (int i = 0; i < bst.size(); i++) {
        cout<< bst[i] <<", ";
    }
    cout <<endl;
    deallocate_tree(t);

    return 0;
}