二叉树 创建 遍历！！！

/*二叉树  创建  遍历*/#include <iostream>using namespace std;struct TreeNode{int val;TreeNode *left;TreeNode *right;};void creatBTree(TreeNode *T){   TreeNode *Tr = new TreeNode;Tr->val=1;Tr->left->val=2;Tr->right->val=3;}/*char ch;cin>>ch;if(ch== '#')T = NULL;else{TreeNode *T = new TreeNode;T->val=ch;//cout<<"输入"<<ch<<"的左孩子"<<endl;//creatBTree(T->left);//cout<<"输出T的值"<<T->val<<endl;//cout<<"输入"<<ch<<"的右孩子"<<endl;//creatBTree(T->right);//cout<<"输出T的值"<<T->val<<endl;}}*//*TreeNode *creat(int x){TreeNode *t = new TreeNode;t->val=x;t->left=NULL;t->right=NULL;//creat(t->left);//creat(t->right);return t;}*/void preBTree(TreeNode *T){if(T==NULL)return;cout<<T->val;preBTree(T->left);preBTree(T->right);}void main(){TreeNode *T = new TreeNode;/*   T = creat(1);T->left=creat(2);T->right=creat(3);*/creatBTree(T);preBTree(T);system("pause");}