劍指offer中題目:http://ac.jobdu.com/problem.php?pid=1521
- 輸入:
-
輸入可能包含多個測試樣例,輸入以EOF結束。
對於每個測試案例,輸入的第一行爲一個整數n(0<=n<=1000,n代表將要輸入的二叉樹節點的個數(節點從1開始編號)。接下來一行有n個數字,代表第i個二叉樹節點的元素的值。接下來有n行,每行有一個字母Ci。
Ci=’d’表示第i個節點有兩子孩子,緊接着是左孩子編號和右孩子編號。
Ci=’l’表示第i個節點有一個左孩子,緊接着是左孩子的編號。
Ci=’r’表示第i個節點有一個右孩子,緊接着是右孩子的編號。
Ci=’z’表示第i個節點沒有子孩子。
- 輸出:
-
對應每個測試案例,
按照前序輸出其孩子節點的元素值。
若爲空輸出NULL。
- 樣例輸入:
-
7 8 6 10 5 7 9 11 d 2 3 d 4 5 d 6 7 z z z z
- 樣例輸出:
-
8 10 11 9 6 7 5
#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 1001
#define DEFAULTDATA 0x7fffffff
typedef struct STreeNode
{
int data;
int left;
int right;
}STreeNode;
STreeNode* createNode(int vData)
{
STreeNode *Node = (STreeNode*)malloc(sizeof(STreeNode));
Node->data = vData;
Node->left = -1;
Node->right = -1;
return Node;
}
void deleteNode(STreeNode **vNode)
{
(*vNode)->left = -1;
(*vNode)->right = -1;
free(*vNode);
*vNode = NULL;
}
void allocNode(STreeNode *vNode[], int vSize)
{
if (vSize <= 0 || vSize >= MAXSIZE) return;
int i;
for (i = 1; i <= vSize; ++i)
{
vNode[i] = createNode(DEFAULTDATA);
if (vNode[i] == NULL) return;
}
}
void deleteNode(STreeNode *vNode[], int vSize)
{
if (vSize <= 0 || vSize >= MAXSIZE) return;
int i;
for (i = 1; i <= vSize; ++i)
{
deleteNode(&(vNode[i]));
}
}
void clearNode(STreeNode *vNode[], int vSize)
{
if (vSize <= 0 || vSize >= MAXSIZE) return;
int i;
for (i = 1; i <= vSize; ++i)
{
vNode[i]->data = DEFAULTDATA;
vNode[i]->left = -1;
vNode[i]->right = -1;
}
}
void createBinaryTree(STreeNode *vTreeNode[], int vN)
{
if (vN == 0) return;
int i;
int Left;
int Right;
char Op;
for (i = 1; i <= vN; ++i)
{
while (getchar() != '\n') continue;//這個地方坑爹,直接getchar()不正確
scanf("%c", &Op);
if (Op == 'd')
{
scanf("%d %d", &Left, &Right);
vTreeNode[i]->left = Left;
vTreeNode[i]->right = Right;
}
else if (Op == 'l')
{
scanf("%d", &Left);
vTreeNode[i]->left = Left;
}
else if (Op == 'r')
{
scanf("%d", &Right);
vTreeNode[i]->right = Right;
}
}
}
void sweep(int *vLeft, int *vRight)
{
int Data;
Data =*vLeft;
*vLeft =*vRight;
*vRight = Data;
}
void switchTree(STreeNode *vTreeNode[], int vRoot)
{
if (vRoot == -1) return;
if (vTreeNode[vRoot]->left == -1 && vTreeNode[vRoot]->right == -1) return;
sweep(&(vTreeNode[vRoot]->left), &(vTreeNode[vRoot]->right));
switchTree(vTreeNode, vTreeNode[vRoot]->left);
switchTree(vTreeNode, vTreeNode[vRoot]->right);
}
void prePrintTree(STreeNode *vTreeNode[], int vRoot, int &vCount, int vN)
{
if (vRoot == -1) return;
if (vCount == vN) printf("%d\n", vTreeNode[vRoot]->data);
else printf("%d ", vTreeNode[vRoot]->data);
++vCount;
prePrintTree(vTreeNode, vTreeNode[vRoot]->left, vCount, vN);
prePrintTree(vTreeNode, vTreeNode[vRoot]->right, vCount, vN);
}
int main()
{
int i;
int N;
STreeNode *TreeNode[MAXSIZE];
allocNode(TreeNode, MAXSIZE-1);
while (scanf("%d", &N) != EOF)
{
if (N == 0)
{
printf("NULL\n");
continue;
}
for (i=1; i <= N; ++i)
{
scanf("%d", &(TreeNode[i]->data));
}
createBinaryTree(TreeNode, N);
switchTree(TreeNode, 1);
int Count = 1;
prePrintTree(TreeNode, 1, Count, N);
clearNode(TreeNode, N);
}
deleteNode(TreeNode, MAXSIZE-1);
return 0;
}
/**************************************************************
Problem: 1521
User:
Language: C++
Result: Accepted
Time:0 ms
Memory:1020 kb
****************************************************************/