数据结构上机实验报告-二叉树(11)

//前序

printf("PreOrder:\n"); BT_PreOrder(root); printf("\n"); printf("PreOrder no recursion:\n"); BT_PreOrderNoRec(root); printf("\n");

//中序

printf("InOrder:\n"); BT_InOrder(root); printf("\n"); printf("InOrder no recursion:\n"); BT_InOrderNoRec(root); printf("\n");

//后序

printf("PostOrder:\n"); BT_PostOrder(root); printf("\n");

//层序

printf("LevelOrder:\n"); BT_LevelOrder(root); printf("\n"); }