r!=NULL)Р?{Р inorder(ptr->left);Р printf("[%2d]",ptr->data);Р inorder(ptr->right);Р?}Р}Р/*------------------二叉树查找----------------*/Рbtree search(btree root,int num)Р{?Р?if((!root)||(root->data==num))Р return root;Р?else if(num<root->data)Р return(search(root->left,num));Р?elseР return(search(root->right,num));Р}Р/*------------------主函数---------------------*/Рvoid main()Р{Р?btree root=NULL,searchnode;Р?int data[9]={5,1,3,9,7,2,6,4,8};Р?int i,num;Р?printf("原数组为:");Р?for(i=0;i<9;i++)Р printf("%2d",data[i]);Р?root=createbtree(data,9);Р?printf("\n生成的二叉树为:\n");Р?inorder(root);Р?printf("\n");Р?printf("请输入需要查找的数:");Р?scanf("%d",&num);Р?searchnode=search(root,num);Р?printf("找到需要查找的数%d,在原数组的第%d位\n",searchnode->data,(searchnode-root)/4>5?(searchnode-root)/4:(searchnode-root)/4+1);Р}Р实验结果Р折半查找:Р二叉树查找:
全文预览
