数据结构_二叉树各种算法实现(6)

printf("二叉树的宽度：\n"); int Wdh=Width(btr);

printf("%d \n",Wdh);

printf("层次遍历二叉树:\n"); TraversalOfLevel(btr);

printf("\n");

printf("复制的二叉树为:\n"); BTree * cp=copy(btr);

TraversalOfLevel(cp);

printf("\n");

if(Similar(btr,cp)==1)

printf("此两二叉树相似\n"); else printf("此两二叉树不相似\n");

if(CompTree(btr,cp)==1)

printf("此两二叉树相等\n"); else printf("此两二叉树不相等\n");

return 0;

}

运行截图：