二叉树

方法二：

 1 #include<iostream>
 2 using namespace std;
 3  
 4 struct BTNode
 5 {
 6  
 7     char data;
 8     BTNode *left, *right;
 9     BTNode(char val) : data(val), left(NULL), right(NULL) {}
10     ~BTNode()
11     {
12         delete left;
13         delete right;
14     }
15 };
16  
17 void CreateBTree(BTNode *&root)
18 {
19     char ch; //要插入的数据  
20     cin >> ch;
21     if (ch == '#')
22         root = NULL;
23     else
24     {
25         root = new BTNode(ch);
26         printf("请输入%c的左孩子：", ch);
27         CreateBTree(root->left);
28         printf("请输入%c的右孩子：", ch);
29         CreateBTree(root->right);
30     }
31 }
32  
33 int main()
34 {
35     BTNode *root;
36     return 0;
37 }

 1 #include<iostream>
 2 using namespace std;
 3  
 4 struct BTNode
 5 {
 6  
 7     char data;
 8     BTNode *left, *right;
 9     BTNode(char val) : data(val), left(NULL), right(NULL) {}
10     ~BTNode()
11     {
12         delete left;
13         delete right;
14     }
15 };
16  
17 void CreateBTree(BTNode *&root)
18 {
19     char ch; //要插入的数据  
20     cin >> ch;
21     if (ch == '#')
22         root = NULL;
23     else
24     {
25         root = new BTNode(ch);
26         root->data = ch;
27         printf("请输入%c的左孩子：", ch);
28         CreateBTree(root->left);
29         printf("请输入%c的右孩子：", ch);
30         CreateBTree(root->right);
31     }
32 }
33  
34 int main()
35 {
36     BTNode *root;
37     return 0;
38 }

相关阅读:
[总结]链表与栈
统计学基础知识
图卷积神经网络(GCN)入门
[总结]字符串
[总结]数组
[总结]排序算法分析与实现
[Leetcode]307. Range Sum Query
深度解析Droupout与Batch Normalization
深度解析Graph Embedding
Console命令，让js调试更简单

原文地址：https://www.cnblogs.com/sunbines/p/9637289.html