codeVS 3110 二叉查找树做法

 1 #include<iostream>
 2 using namespace std;
 3 typedef struct Node{
 4     int data;
 5     Node *lchild,*rchild;
 6 }Node,*Tree;
 7 Tree bst=NULL;
 8 int n,a[500001];
 9 void Init_tree(Tree &bst,int k){
10     if(!bst){
11         bst=new Node;
12         bst->data=k;
13         bst->lchild=bst->rchild=NULL;
14     }
15     else{
16         if(k>bst->data)    Init_tree(bst->rchild,k);
17         else    Init_tree(bst->lchild,k);
18     }
19 }
20 void z_sort(Tree &bst){
21     if(bst){
22         z_sort(bst->lchild);
23         cout<<bst->data<<" ";
24         z_sort(bst->rchild);
25     }
26 }
27 int main(){
28     bst=NULL;
29     cin>>n;
30     for(int i=1;i<=n;++i){
31         cin>>a[i];
32         int k=a[i];
33         Init_tree(bst,k);
34     }
35     z_sort(bst);
36     return 0;
37 }