创建链表，保存在arr矩阵中

#include <iostream>
#include <vector>
using namespace std;
vector<char> arr;

typedef struct BinaryTreeNode
{
    char data;
    struct BinaryTreeNode* Left;
    struct BinaryTreeNode* Right;
}Node;

void preOrderTraverse(Node* root)
{
    arr.push_back(root->data);
    cout << root->data;
    if (root)
    {
        preOrderTraverse(root->Left);
        preOrderTraverse(root->Right);
    }
}
Node* createBinaryTree()
{
    Node* p;
    char ch;
    cin >> ch;
    if (ch == '0')     
    {
        p = NULL;
    }
    else
    {
        p = (Node*)malloc(sizeof(Node));
        p->data = ch;
        p->Left = createBinaryTree();  
        p->Right = createBinaryTree();  
    }
    return p;
}

int main()
{
    Node* m;
    m = createBinaryTree();
    preOrderTraverse(m);

	return 0;
}