7-4-List Leaves-编程题

解题代码

#include<stdio.h>
#include<stdlib.h>
typedef struct STNode* pST;
struct STNode {
	int left;
	int right;
};
typedef struct queue* pqu;
struct queue {
	struct STNode data;
	int index;
};
int CreatSTree(pST T, int N);
void Leave(pST T, int R);
int main()
{
	int N;//n of sTNode
	scanf("%d", &N);
	pST T = (pST)malloc(N * sizeof(struct STNode));
	int R = CreatSTree(T, N);
	//int i;
	//for (i = 0; i < N; i++) printf("T[%d].left=%d\tT[%d].right=%d\n", i, T[i].left, i, T[i].right);
	Leave(T, R);
	return 0;
}
int CreatSTree(pST T, int N) {
	int *check = (int *)malloc(N * sizeof(int));
	int i;
	for (i = 0; i < N; i++) check[i] = 0;
	char tleft, tright;
	for (i = 0; i < N; i++) {
		scanf("\n%c %c", &tleft, &tright);
		if (tleft == '-') T[i].left = -1;
		else {
			T[i].left = tleft - '0';
			check[T[i].left] = 1;
		}
		if (tright == '-') T[i].right = -1;
		else {
			T[i].right = tright - '0';
			check[T[i].right] = 1;
		}
	}
	for (i = 0; i < N; i++) {
		if (!check[i]) return i;
	}
}
void Leave(pST T, int R) {
	pqu queue = (pqu)malloc(10 * sizeof(struct queue));
	int rear = -1, front = -1;
	queue[++rear].data = T[R];
	queue[rear].index = R;
	int flag = 1;
	while (front < rear) {
		//printf("front=%d\trear=%d\n", front, rear);
		if (queue[front + 1].data.left != -1) {
			queue[++rear].index = queue[front + 1].data.left;
			queue[rear].data = T[queue[rear].index];
			//printf("queue[%d].data.left=%d\tqueue[%d].data.right=%d\tqueue[%d].index=%d\n", rear, queue[rear].data.left, rear, queue[rear].data.right, rear, queue[rear].index);
		}
		if (queue[front + 1].data.right != -1) {
			queue[++rear].index = queue[front + 1].data.right;
			queue[rear].data = T[queue[rear].index];
		}
		else if(queue[front + 1].data.left == -1){
			if (flag) flag = 0;
			else printf(" ");
			printf("%d", queue[front+1].index);
		}
		front++;
	}
}

测试结果

问题整理

1.因为需要输出的结点序号是通过index在输入中体现的，而queue如只指向Node，则printf的内容找不到。故需要在queue中再添加一个内容，来记录index。
2.一般在遍历左右子树的情况，都使用连续的两个if（中间没有else），这时就要注意双if后边的条件判断。