二叉查找树

二叉查找树

#include <iostream>
#include <cstdlib>
using namespace std;
typedef int type;
typedef struct bstreenode{
    type key;
    struct bstreenode *parent;
    struct bstreenode *left;
    struct bstreenode *right;
}node,*bstree;
node* createNode(type key,node* parent,node* left,node* right){
    node *p=(node *)malloc(sizeof(node));
    p->key=key;
    p->parent=parent;
    p->left=left;
    p->right=right;
    return p;
}
void insertNode(bstree tree,node* p){
    //找位置
    node* pos=tree;
    cout<<(pos==NULL)<<endl;
    while(pos!=NULL){
        if(p->key<pos->key){//向左 
            pos=pos->left; 
        }else{
            pos=pos->right;
        }
    }
    //插入节点 
    cout<<"111"<<endl;
    node* f=pos->parent;
    cout<<f<<endl;
    p->parent=f;
    if(f==NULL){
        tree=p;
    }else if(f->key>p->key){//左孩子 
        f->left=p; 
    }else{
        f->right=p;    
    }
}
void insertNode_out(bstree tree,type key){
    node* p=createNode(key,NULL,NULL,NULL);
    insertNode(tree,p);
}


int main(){
    bstree tree=(node*)malloc(sizeof(node));
    tree->left=tree->right=tree->parent=NULL; 
    insertNode_out(tree,5);
    insertNode_out(tree,6);
    insertNode_out(tree,4);
    insertNode_out(tree,7);
    insertNode_out(tree,1);
    insertNode_out(tree,8);
    return 0;
}