摘要: typedef struct BST { int key; BST *left; BST *right;}BST;BST *root;void insert(BST *ROOT,int key){ BST *p,*f; p = ROOT; f = NULL; while ( p != NULL ) { if ( key < p->key ) { f = p; p = p->left; } else { f = p... 阅读全文
posted @ 2012-12-21 21:19 Sinker 阅读(133) 评论(0) 推荐(0) 编辑