选择您对红黑平衡二叉树的操作:");intj;scanf("%d",&j);charJudge='Y';while(Judge=='Y'){switch(j){case1:PRBTreeNodep_Node;printf("请输入要插入元素的数值:");scanf("%d",&p_Node->key);RBTREE_INSERT(&bsTree,p_Node);break;case2:printf("请输入要查找元素的数值:");intval_key;scanf("%d",&val_key);PRBTreeNodepnode;pnode=RBTREE_SEARCH(bsTree.root,val_key);printf("元素为值:%d,元素颜色为:%s,左孩子:%d,左孩子:%d\n",pnode->key,pnode->color==BLACK?"BLACK":"RED",pnode->left->key,pnode->right->key);break;case3:PRBTreeNodep_Del;printf("请输入要删除元素的数值:");scanf("%d",&p_Del->key);RBTREE_DELETE(&bsTree,p_Del);break;case4:intK;printf("请输入K值:");scanf("%d",&K);K_min_elem(&bsTree,K);break;case0:return0;default:break;}printf("操作完成!请选择继续-Y退出-N:");scanf("%C",&Judge);}return0;}3.5用户界面设计...........................................................................................14
全文预览
