数据结构快速回顾——二叉查找树

  1 #include<stdio.h>
  2 
  3 typedef    struct node
  4 {
  5     int value;
  6     struct node* pleft;
  7     struct node* pright;
  8     
  9 }BNode;
 10 
 11 void Visit(BNode *pRoot)
 12 {
 13     printf("%d\t",pRoot->value);
 14 }
 15 void InOrderTraverse(BNode *pRoot)
 16 {
 17     if(pRoot == NULL)
 18         return;
 19     InOrderTraverse(pRoot->pleft);
 20     Visit(pRoot);
 21     InOrderTraverse(pRoot->pright);
 22 }
 23 //由于可能改变指针位置，所以使用指针的引用作为形参 
 24 BNode* InsertBST(BNode *&root, int value)
 25 {
 26     if(root == NULL)
 27     {
 28         BNode* n = new BNode();
 29         n->value = value;
 30         n->pleft = NULL;
 31         n->pright = NULL;
 32         root = n;
 33         return root;
 34     }    
 35     if(root->value < value)
 36     {
 37         root->pright = InsertBST(root->pright, value);
 38     }
 39     else 
 40     {
 41         root->pleft = InsertBST(root->pleft, value);
 42     }
 43     return root;
 44 }
 45 
 46 //由于可能改变指针位置，所以使用指针的引用作为形参 
 47 void InsertBST2(BNode *&root, int val)
 48 {
 49 
 50     BNode* n = new BNode();
 51     n->value = val;
 52     n->pleft = NULL;
 53     n->pright = NULL;
 54     
 55     if(!root)
 56     {
 57         root = n;
 58         return;
 59     }
 60     
 61     BNode* tmp = root;
 62     while(tmp)
 63     {
 64         if(tmp->value < n->value)
 65         {
 66             if(tmp->pright)
 67             {
 68                 tmp = tmp->pright;    
 69                 continue;            
 70             }
 71             else
 72             {
 73                 tmp->pright = n;
 74                 return;
 75             }
 76         }
 77         else
 78         {
 79             if(tmp->pleft)
 80             {
 81                 tmp = tmp->pleft;    
 82                 continue;            
 83             }
 84             else
 85             {
 86                 tmp->pleft = n;
 87                 return;
 88             }
 89                 
 90         }
 91     }
 92 }
 93 
 94 int main()
 95 {
 96 
 97     BNode* pnode = NULL;
 98     
 99     int data[8]= {3,2,6,3,8,6,1,4};
100     for(int i=0;i <8;i++)
101     {
102         //InsertBST2(pnode,data[i]);
103         InsertBST(pnode,data[i]);
104     }
105     
106     InOrderTraverse(pnode);
107     return 0;
108 }
109