/*---------------------------------------------------*/
/*主程序                                             */
/*---------------------------------------------------*/
#include"BTree_Inorder_NoRecursion_Traverse.cpp"
void main()
{
	b_tree root=NULL;
    
	int nodelist[16]={0,5,2,9,1,4,7,0,0,0,3,0,6,8,0,0};

	root=create_btree(nodelist,1);

	printf("The node content of the linklist binary tree is :\n");
	inorder_print_btree(root);
	printf("\n");
	//以上二叉樹建立完畢！下面是以非遞歸方式遍歷二叉樹
    printf("中序非遞歸遍歷二叉樹結(jié)果為:");
	InOrderTraverse(root);
	printf("\n");
}