int main() { Status i; int j; position p; TElemType e; TElemType s; InitBiTree( T ); CreateBiTree( T ); printf("After initializing the Tree, is the Tree empty? Yes:1, No:0, the depth is: %d\n", BiTreeEmpty( T ), BiTreeDepth(T)); i = Root( T, &e ); if( i ) printf("The root of the tree is: %d\n", e); else printf("The tree is empty!\n"); printf("Traverse_1:\n"); LevelOrderTraverse( T, visit ); printf("Traverse_2:\n"); InOrderTraverse( T, visit ); printf("Traverse_3:\n"); PostOrderTraverse( T, visit ); printf("input the level number to be modified \n"); scanf(" %d%d", &p.level, &p.order); e = Value( T, p); printf("The old value is %d, input new value: ", e); scanf(" %d", &e); Assign( T, p, e); printf("Traverse_1:\n"); PreOrderTraverse( T, visit ); printf("The parent of node %d is %d, left and right children are: ", e, Parent(T, e)); printf("%d, %d, left and rignt brothers are:", LeftChild(T, e), RightChild(T, e)); printf("%d, %d\n", LeftSibling(T, e), RightSibling(T, e)); InitBiTree( s ); printf("Initializing a Tree that has empty right subtree:\n"); CreateBiTree( s ); printf("The tree s insert to the tree T, input the parent node of s, s is left subtree or right subtree."); scanf(" %d%d%d", &p.level, &p.order, &j); DeleteChild( T, p, j); Print( T ); clearBiTRee( T ); printf("After clearing the tree, is the tree empty? Yes:1, No:0 %d\n", BiTreeEmpty( T ), BiTreeDepth(T)); i = Root( T, &e ); if( i ) printf("The root of the bitree is %d\n", e); else printf("The tree is empty, no root!\n"); }
void main() { Status i; int j; position p; TElemType e; SqBiTree T,s; InitBiTree(T); CreateBiTree(T); printf("建立二叉树后,树空否?%d(1:是 0:否) 树的深度=%d\n",BiTreeEmpty(T),BiTreeDepth(T)); i=Root(T,&e); if(i) printf("二叉树的根为:%d\n",e); else printf("树空,无根\n"); printf("层序遍历二叉树:\n"); LevelOrderTraverse(T,visit); printf("中序遍历二叉树:\n"); InOrderTraverse(T,visit); printf("后序遍历二叉树:\n"); PostOrderTraverse(T,visit); printf("请输入待修改结点的层号 本层序号: "); scanf("%d%d",&p.level,&p.order); e=Value(T,p); printf("待修改结点的原值为%d请输入新值: ",e); scanf("%d",&e); Assign(T,p,e); printf("先序遍历二叉树:\n"); PreOrderTraverse(T,visit); printf("结点%d的双亲为%d,左右孩子分别为",e,Parent(T,e)); printf("%d,%d,左右兄弟分别为",LeftChild(T,e),RightChild(T,e)); printf("%d,%d\n",LeftSibling(T,e),RightSibling(T,e)); InitBiTree(s); printf("建立右子树为空的树s:\n"); CreateBiTree(s); printf("树s插到树T中,请输入树T中树s的双亲结点 s为左(0)或右(1)子树: "); scanf("%d%d",&e,&j); InsertChild(T,e,j,s); Print(T); printf("删除子树,请输入待删除子树根结点的层号 本层序号 左(0)或右(1)子树: "); scanf("%d%d%d",&p.level,&p.order,&j); DeleteChild(T,p,j); Print(T); ClearBiTree(T); printf("清除二叉树后,树空否?%d(1:是 0:否) 树的深度=%d\n",BiTreeEmpty(T),BiTreeDepth(T)); i=Root(T,&e); if(i) printf("二叉树的根为:%d\n",e); else printf("树空,无根\n"); }
int main(int argc, const char * argv[]) { printf("test\n"); int i; long x ; x = CountSeconds(1456,1700); printf("%ld\n",x); // struct LNode Biu; d // Biu.data = 12; // printf("%d\n",Biu.data); // DouLNode Head = (DouLNode) malloc (sizeof(DouLNode *)); // DouLNode test1 =(DouLNode) malloc (sizeof(DouLNode *)); // DouLNode test2 = (DouLNode) malloc (sizeof(DouLNode *)); BinaryTree Root = InitBiTree(); BinaryTree test1 = InitBiTree(); BinaryTree test2 = InitBiTree(); BinaryTree pointer = Root; Root->data = 0; // Root->leftChild // Head->next = Head; // test1->data = 1; // test2->data = 2; for (i = 1; i <= 3; i++) { printf("%d\n",pointer->data); // pointer = pointer->next; } // struct LNode *bb; // printf("%lu",sizeof(*Head)); // free(Head); free(test1); free(test2); puts("test"); puts("test"); bulbSwitch(100); return 0; }
main() { BiTNode * n1 = MakeNode(10, NULL, NULL); BiTNode * n2 = MakeNode(20, NULL, NULL); BiTNode * n3 = MakeNode(30, n1, n2); BiTNode * n4 = MakeNode(40, NULL, NULL); BiTNode * n5 = MakeNode(50, NULL, NULL); BiTNode * n6 = MakeNode(60, n4, n5); BiTNode * n7 = MakeNode(70, NULL, NULL); BiTree tree = InitBiTree(n7); SetLChild(tree, n3); SetRChild(tree, n6); printf("树的深度为:%d \n", GetDepth(tree)); printTree(tree, GetDepth(tree)); printf("\n先序遍历如下:"); PreOrderTraverse(tree, print); printf("\n中序遍历如下:"); InOrderTraverse(tree, print); printf("\n后序遍历如下:"); PostOrderTraverse(tree, print); DeleteChild(tree, 1); printf("\n后序遍历如下:"); PostOrderTraverse(tree, print); DestroyBiTree(tree); if (IsEmpty(tree)) printf("\n二叉树为空,销毁完毕\n"); }
void CreateBiTree(SqBiTree T) { // 按层序次序输入二叉树中结点的值(字符型或整型), 构造顺序存储的二叉树T int i=0; InitBiTree(T); // 构造空二叉树T #if CHAR // 结点类型为字符 int l; char s[MAX_TREE_SIZE]; cout<<"请按层序输入结点的值(字符),空格表示空结点,结点数≤"<<MAX_TREE_SIZE<<':'<<endl; gets(s); // 输入字符串 l=strlen(s); // 求字符串的长度 for(;i<l;i++) // 将字符串赋值给T T[i]=s[i]; #else // 结点类型为整型 cout<<"请按层序输入结点的值(整型),0表示空结点,输999结束。结点数≤"<<MAX_TREE_SIZE<<':'<<endl; while(1) { cin>>T[i]; if(T[i]==999) { T[i]=Nil; break; } i++; } #endif for(i=1;i<MAX_TREE_SIZE;i++) if(i!=0&&T[(i+1)/2-1]==Nil&&T[i]!=Nil) // 此结点(不空)无双亲且不是根 { cout<<"出现无双亲的非根结点"<<T[i]<<endl; exit(ERROR); } }
void main() { TElemType e; SqBiTree T; InitBiTree(T); CreateBiTree(T); printf("请输入待查询结点的值:"); scanf("%d",&e); printf("结点%d的双亲为%d,左右孩子分别为",e,Parent(T,e)); printf("%d,%d,左右兄弟分别为",LeftChild(T,e),RightChild(T,e)); printf("%d,%d\n",LeftSibling(T,e),RightSibling(T,e)); }
void main() { BiTree T; InitBiTree(&T); #ifdef CHAR printf("请先序输入二叉树(如:ab三个空格表示a为根结点,b为左子树的二叉树)\n"); #endif #ifdef INT printf("请先序输入二叉树(如:1 2 0 0 0表示1为根结点,2为左子树的二叉树)\n"); #endif CreateBiTree(&T); printf("中序非递归遍历二叉树(另一种方法):\n"); InOrderTraverse2(T,visitT); }
void main() { int i; BiTree T, p, c; TElemType e1, e2; InitBiTree(&T); printf("构造空二叉树后,树空否?%d(1:是 0:否) 树的深度=%d\n", BiTreeEmpty(T), BiTreeDepth(T)); e1 = Root(T); if (e1 != Nil) #ifdef CHAR printf("二叉树的根为: %c\n", e1); #endif #ifdef INT printf("二叉树的根为: %d\n", e1); #endif else
int main() { Status i; Position p; TElemType e; SqBiTree T; InitBiTree(T); CreateBiTree(T); printf("建立二叉树后,树空否?%d(1:是 0:否) 树的深度=%d\n",BiTreeEmpty(T),BiTreeDepth(T)); i=Root(T,&e); if(i) printf("二叉树的根为:%d\n",e); else printf("树空,无根\n"); printf("层序遍历二叉树:\n"); LevelOrderTraverse(T); printf("前序遍历二叉树:\n"); PreOrderTraverse(T); printf("中序遍历二叉树:\n"); InOrderTraverse(T); printf("后序遍历二叉树:\n"); PostOrderTraverse(T); printf("修改结点的层号3本层序号2。"); p.level=3; p.order=2; e=Value(T,p); printf("待修改结点的原值为%d请输入新值:50 ",e); e=50; Assign(T,p,e); printf("前序遍历二叉树:\n"); PreOrderTraverse(T); printf("结点%d的双亲为%d,左右孩子分别为",e,Parent(T,e)); printf("%d,%d,左右兄弟分别为",LeftChild(T,e),RightChild(T,e)); printf("%d,%d\n",LeftSibling(T,e),RightSibling(T,e)); ClearBiTree(T); printf("清除二叉树后,树空否?%d(1:是 0:否) 树的深度=%d\n",BiTreeEmpty(T),BiTreeDepth(T)); i=Root(T,&e); if(i) printf("二叉树的根为:%d\n",e); else printf("树空,无根\n"); return 0; }
BinaryTree * CreateBiTree(){ char c; BinaryTree * binaryTree=NULL; c=getchar(); if(c==' '){ binaryTree=NULL; }else{ binaryTree=InitBiTree(); binaryTree->data=c-'0'; binaryTree->lChild=CreateBiTree(); binaryTree->rChild=CreateBiTree(); } return binaryTree; }
//SqBiTree的测试程序 int main(int argc,char *argv[]) { int i=0; char buf[1024]; char e,newe; char *temp; bool k; position p; BiTree T,C; BiTree q,q2; InitBiTree(T); InitBiTree(C); printf("输入数据创建二叉树(#表示空):"); scanf("%s%*c",buf); temp=buf; CreateBiTree(T,temp,i); printf("\n遍历(前、中、后、层):"); PreOrderTraverse(T,Visit); printf("\n"); InOrderTraverse(T,Visit); printf("\n"); PostOrderTraverse(T,Visit); printf("\n"); LevelOrderTraverse(T,Visit); printf("\n二叉树是否为空:%s",BiTreeEmpty(T)==1?"空":"非空"); printf("\n树的深度:%d",BiTreeDepth(T)); printf("\n根节点的左孩子、双亲、左右孩子、左右兄弟节点"); q=LeftChild(T,*T); printf("\n%c %c %c %c %c %c",q==NULL?Nil:q->e,(q2=Parent(T,*q))==NULL?Nil:q2->e,(q2=LeftChild(T,*q))==NULL?Nil:q2->e, (q2=RightChild(T,*q))==NULL?Nil:q2->e,(q2=LeftSibling(T,*q))==NULL?Nil:q2->e, (q2=RightSibling(T,*q))==NULL?Nil:q2->e); printf("\n节点的新值:"); scanf("%c%*c",&newe); Assign(T,*q,newe); printf("\n替换后遍历(前、中、后、层):"); PreOrderTraverse(T,Visit); printf("\n"); InOrderTraverse(T,Visit); printf("\n"); PostOrderTraverse(T,Visit); printf("\n"); LevelOrderTraverse(T,Visit); printf("\n输入数据创建二叉树(#表示空):"); scanf("%s%*c",buf); temp=buf; i=0; CreateBiTree(C,temp,i); printf("\n输入要插入数据的层、序号和左右子树(0左1右):"); scanf("%d%d%d%*c",&p.level,&p.order,&k); InsertChild(T,p,k,C); printf("\n遍历(前、中、后、层):"); PreOrderTraverse(T,Visit); printf("\n"); InOrderTraverse(T,Visit); printf("\n"); PostOrderTraverse(T,Visit); printf("\n"); LevelOrderTraverse(T,Visit); printf("\n删除%d层%d个节点的右子树后遍历:",p.level,p.order); DeleteChild(T,p,1); printf("\n遍历(前、中、后、层):"); PreOrderTraverse(T,Visit); printf("\n"); InOrderTraverse(T,Visit); printf("\n"); PostOrderTraverse(T,Visit); printf("\n"); LevelOrderTraverse(T,Visit); DestroyBiTree(T); system("pause"); return 0; }
void main() { int i; BiPTree T,c,q; TElemType e1,e2; InitBiTree(&T); printf("构造空二叉树后,树空否?%d(1:是 0:否)树的深度=%d\n",BiTreeEmpty(T),BiTreeDepth(T)); e1=Root(T); if(e1!=Nil) printf("二叉树的根为: "form"\n",e1); else printf("树空,无根\n"); #ifdef CHAR printf("请按先序输入二叉树(如:ab三个空格表示a为根结点,b为左子树的二叉树)\n"); #endif #ifdef INT printf("请按先序输入二叉树(如:1 2 0 0 0表示1为根结点,2为左子树的二叉树)\n"); #endif CreateBiTree(&T); printf("建立二叉树后,树空否?%d(1:是 0:否) 树的深度=%d\n",BiTreeEmpty(T),BiTreeDepth(T)); e1=Root(T); if(e1!=Nil) printf("二叉树的根为: "form"\n",e1); else printf("树空,无根\n"); printf("中序递归遍历二叉树:\n"); InOrderTraverse(T,visitT); printf("\n后序递归遍历二叉树:\n"); PostOrderTraverse(T,visitT); printf("\n层序遍历二叉树:\n"); LevelOrderTraverse(T,visitT); printf("\n请输入一个结点的值: "); scanf("%*c"form,&e1); c=Point(T,e1); /* c为e1的指针 */ printf("结点的值为"form"\n",Value(c)); printf("欲改变此结点的值,请输入新值: "); scanf("%*c"form"%*c",&e2); Assign(c,e2); printf("层序遍历二叉树:\n"); LevelOrderTraverse(T,visitT); e1=Parent(T,e2); if(e1!=Nil) printf("\n"form"的双亲是"form"\n",e2,e1); else printf(form"没有双亲\n",e2); e1=LeftChild(T,e2); if(e1!=Nil) printf(form"的左孩子是"form"\n",e2,e1); else printf(form"没有左孩子\n",e2); e1=RightChild(T,e2); if(e1!=Nil) printf(form"的右孩子是"form"\n",e2,e1); else printf(form"没有右孩子\n",e2); e1=LeftSibling(T,e2); if(e1!=Nil) printf(form"的左兄弟是"form"\n",e2,e1); else printf(form"没有左兄弟\n",e2); e1=RightSibling(T,e2); if(e1!=Nil) printf(form"的右兄弟是"form"\n",e2,e1); else printf(form"没有右兄弟\n",e2); InitBiTree(&c); printf("构造一个右子树为空的二叉树c:\n"); #ifdef CHAR printf("请先序输入二叉树(如:ab三个空格表示a为根结点,b为左子树的二叉树)\n"); #endif #ifdef INT printf("请先序输入二叉树(如:1 2 0 0 0表示1为根结点,2为左子树的二叉树)\n"); #endif CreateBiTree(&c); printf("先序递归遍历二叉树c:\n"); PreOrderTraverse(c,visitT); printf("\n树c插到树T中,请输入树T中树c的双亲结点 c为左(0)或右(1)子树: "); scanf("%*c"form"%d",&e1,&i); q=Point(T,e1); InsertChild(q,i,c); printf("先序递归遍历二叉树:\n"); PreOrderTraverse(T,visitT); printf("\n删除子树,请输入待删除子树的双亲结点 左(0)或右(1)子树: "); scanf("%*c"form"%d",&e1,&i); q=Point(T,e1); DeleteChild(q,i); printf("先序递归遍历二叉树:\n"); PreOrderTraverse(T,visitT); printf("\n"); DestroyBiTree(&T); }
int main() { /** * 建立一个含三个元素的二叉树进行测试 */ BiTreeNode *leftNode = (BiTreeNode *)malloc(sizeof(BiTreeNode)); BiTreeNode *rightNode = (BiTreeNode *)malloc(sizeof(BiTreeNode)); BiTreeNode *leftLeftNode = (BiTreeNode *)malloc(sizeof(BiTreeNode)); int newData; Queue *queue = (Queue *)malloc(sizeof(Queue)); //定义一个根,然后动态分配一个内存单元 BiTree *T = (BiTree *)malloc(sizeof(BiTree)); // 测试 Initbitree() InitBiTree(T); printf("T 树是否为空 :"); if (BiTreeEmpty(T)) printf("为空\n"); else { printf("不为空\n"); } // 生成根的数据 测试方法 CreateBiTree() printf("请输入根的数据"); scanf("%d", &newData); CreateBiTree(T, newData); printf("T 树是否为空 : "); if (BiTreeEmpty(T)) printf("为空\n"); else { printf("不为空\n"); } // 生成根的左孩子 printf("请输入根的左孩子的数据"); scanf("%d", &newData); T->root->left = leftNode; leftNode->data = newData; leftNode->parent = T->root; // 生成根的左孩子的左孩子 printf("添加根的左孩子的左孩子用于测试"); scanf("%d", &newData); T->root->left->left = leftLeftNode; leftLeftNode->data = newData; leftLeftNode->parent = T->root->left; // 生成根的右孩子 printf("请输入根的右子树"); scanf("%d", &newData); T->root->right = rightNode; rightNode->data = newData; rightNode->parent = T->root; /** * 打印出根的数据 * 测试的方法有 Root() 和 Value() */ printf("根的数据是 :%d\n", Visit(Root(T))); /** * 测试BiTreeDepth() 这个方法 */ printf("树的深度是 %d \n", BiTreeDepth(T->root)); /** * 测试Leftchild() 和 Rightchild() */ printf("根的左孩子的数据是: %d \n", Visit(LeftChild(Root(T)))); printf("根的右孩子的数据是: %d \n", Visit(RightChild(Root(T)))); // 测试 Parent() printf("根的左孩子的父亲节点数据 : %d ", Visit(Parent(T, LeftChild(Root(T))))); // 测试Leftsubling() printf("测试LeftSubling的方法,输出是:%d \n", Visit(LeftSubling(T, T->root->right))); // 测试先序遍历 中序遍历 和 后序遍历 printf("先序测试结果:"); PreOrderTraverse(T->root); printf("\n"); printf("中序测试结果"); InOrderTraverse(T->root); printf("\n"); printf("后序测试结果"); PostOrderTraverse(T->root); printf("\n"); /** * 测试Deletechild()和Destroybitree() 这两个方法 * 在Deletechild() 中调用了Destroybitree() 这个方法 */ printf("删除根的左子树,然后通过先序遍历遍历树\n"); DeleteChild(T, T->root, 0); T->root->left = NULL; PreOrderTraverse(T->root); return 0; }