二叉树的序列化

最新推荐文章于 2022-07-02 19:42:15 发布

acceptedwwh

最新推荐文章于 2022-07-02 19:42:15 发布

阅读量236

点赞数

分类专栏：牛客网文章标签：二叉树

本文链接：https://blog.csdn.net/achiberx/article/details/54573888

版权

牛客网专栏收录该内容

24 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;


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

class TreeToSequence {
public:
    string toSequence(TreeNode* root) {
            if(root == NULL) return "";
            string resultString = "";
            resultString += "(";
            string left = toSequence(root->left);
            string right = toSequence(root->right);
            resultString += left;
            resultString += right;
            resultString += ")";
            return resultString;
    }
};

int main()
{
    TreeNode *root = new TreeNode(1);
    TreeNode *left = new TreeNode(2);
    TreeNode *right = new TreeNode(3);
    root->left = left;
    root->right = right;
    TreeToSequence *obj = new TreeToSequence();
    string res = obj->toSequence(root);
    cout << res << endl;
    delete left;
    delete right;
    delete root;
    return 0;
}