二叉树查找-二分法查找二叉树.docx

二叉树查找-二分法查找二叉树 二分法查找二叉树方法：左大右小，找不到的时候就分支限定的查找 #include cstdlib#include iostream using namespace std;struct tree{ // 声明树的结构 struct tree *left;int data;struct tree *right;};typedef struct tree treenode;//声明新类型的树的结构 typedef treenode *b_tree;//声明二叉树的链表 /*递归建立二叉树*/ b_tree creat_btree(int *nodelist,int position)//看好了某些定义b_tree {b_tree newnode;//声明树根指针 if(nodelist[position]==0||position15){//cout d;return NULL;}else{newnode = (b_tree) malloc(sizeof(treenode));//申请空间 newnode-data=nodelist[position];//建立节点内容 //cout newnode= newnode-data;newnode-left=creat_btree(nodelist,2*position); //递归建立左子树newnode-right=creat_btree(nodelist,2*position+1);//递归建立右子树 return newnode;}}//建立二叉树//二叉树遍历方式查找b_tree btree_travesal_search(b_tree point,int findnode){b_tree point1,point2;//声名往左和往右查询的指针 if(point!=NULL){if(point-data==findnode)return point;else //找左子树point1=btree_travesal_search(point-left,findnode);//找右子树point2=btree_travesal_search(point-right,findnode);if(point1 != NULL)return point1;else if(point2!=NULL)return point2;else return NULL;}else return NULL;}//二叉树二分查找法b_tree btree_travesal_search1(b_tree point, int findnode){while(point!=NULL){if(point-data==findnode)//找到了数据 return point;//返回找到节点的指针 elseif(point-datafindnode){point=point-left;}//向左子树找 else {point=point-right;}//向右子树找 }return NULL;} void inoder(b_tree point){if(point!=NULL){inoder(point-left);cout point-data ;inoder(point-right);}};int main(int argc, char *argv[]){b_tree root = NULL;//树根指针 b_tree point = NULL;int findnode;int i; int nodelist[16]={0,5,2,9,0,4,7,0,0,0,3,0,6,8,0,0};//---------------建立树状结构-----------//root = creat_btree(nodelist,1); //建立 printf(\n The node content of arrary_structure is:\n);printf(\nPlease input the node value(1...9) you want search:);scanf(%d,findnode);//进行遍历查找point=btree_travesal_search(root,findnode);if(point!=NULL){cout \n=Travesal search result: \n;printf( The finding node value is [%d]\n,point-data