先序创建一个二叉树

#include<iostream>
using namespace std;

struct Node {
    char val;
    Node *left;
    Node *right;

    Node() : val(0), left(nullptr), right(nullptr){}
    Node(int v) : val(v), left(nullptr), right(nullptr){}
};


void CreateNode(Node *&root)
{
    char data = 0;
    cin >> data;

    if (data == '#') {
        return;
    }
    root = new Node(data);
    CreateNode(root->left);
    CreateNode(root->right);
}

void PreOrder(Node *root)
{
    if (root == nullptr) {
        return;
    }

    cout<<root->val<<endl;
    PreOrder(root->left);
    PreOrder(root->right);
}

int main()
{

    Node *root = nullptr;
    CreateNode(root);

    PreOrder(root);

    return 0;
}