基础实验4-2.3-二叉树的非递归遍历-函数题

解题代码

void InorderTraversal(BinTree BT) {
	Stack S = CreateStack();
	while (BT || !IsEmpty(S)) {
		while (BT) 	if (Push(S, BT)) BT = BT->Left;
		BT = Pop(S);
		printf(" %c", BT->Data);
		BT = BT->Right;
	}
}
void PreorderTraversal(BinTree BT) {
	Stack S = CreateStack();
	while (BT || !IsEmpty(S)) {
		while (BT) {
			if (Push(S, BT)) {
				printf(" %c", BT->Data);
				BT = BT->Left;
			}
		}
		BT = Pop(S);
		BT = BT->Right;
	}
}
void PostorderTraversal(BinTree BT) {
	Stack S = CreateStack();
	while (BT || !IsEmpty(S)) {
		while (BT) {
			if (Push(S, BT)) BT = BT->Left;
		}
		BT = Peek(S);
		if (BT->flag != 1) {
			BT->flag = 1;
			BT = BT->Right;
		}
		else {
			BT = Pop(S);
			printf(" %c",BT->Data);
			BT = NULL;
		}
	}
}

测试结果

问题整理

1.注意postorder的逻辑