平衡二叉树

平衡二叉树

Time Limit:1000 ms | Memory Limit:32768 KB
Submit:16 (6 users) | Accepted:6 (6 users)

Description

所谓平衡 二叉树就是*￥￥￥@！#@￥##@！*&&（水星文，若看不懂请跳转到下一题）...
你的任务判断输入的二叉树是否为平衡二叉树，是则输出Yes，否则输出No。

Input

每行是一棵二叉树的带 虚结点（#）表示的前序遍历序串，长度不超过2000。每个结点为一个小写字母或一个数字。

Output

对于每行输入的二叉 树，如果是平衡二叉树则输出Yes，否则输出No

Sample Input

#

abc####

Sample Output

Yes

No

Hint

第 一行输入的为空树，我们将其纳入平衡二叉树。

 

 

这题折腾了不少时间，思路几次错误，题倒没什么难的。

#include <iostream> #include <cstring> #include <cmath> #include <cstdlib> #include <algorithm> #include <string> #include <cstdio> #include <climits> #include <queue> #include <map> #include <list> #include <set> #include <vector> using namespace std; int tree[2002][4]; char str[2002]; int cheight(int in = 1) { if (tree[in][0] <= 0 && tree[in][1] <= 0) { tree[in][3] = 1; return 1; } if (tree[in][0] > 0 && tree[in][1] <= 0) { tree[in][3] = cheight(tree[in][0])+1; return tree[in][3]; } if (tree[in][1] > 0 && tree[in][0] <= 0) { tree[in][3] = cheight(tree[in][1])+1; return tree[in][3]; } tree[in][3] = max( cheight(tree[in][0])+1, cheight(tree[in][1])+1); return tree[in][3]; } bool yess = true; void isyes(int in = 1) { if (!yess) return; if (tree[in][0] <= 0 && tree[in][1] <= 0) return; if (abs(tree[tree[in][0]][3]-tree[tree[in][1]][3]) > 1) { // cout << tree[tree[in][0]][3] << tree[tree[in][1]][3] ; yess = false; return; } if (tree[in][0] > 0 && tree[in][0] != 0) isyes(tree[in][0]); if (tree[in][1] > 0 && tree[in][1] != 0) isyes(tree[in][1]); } int main() { while (scanf("%s", str) != EOF) { memset(tree, 0, sizeof(tree)); int index = 2; int now = 1; tree[0][3] = -1; for (int i=1; str[i] != 0; i++) { if (str[i] == '#') { if (tree[now][0] == 0) tree[now][0] = -1; else { //if (now == 1) //cout << "good" << " " << tree[now][0] << tree[now][1] << tree[now][2]; tree[now][1] = -1; now = tree[now][2]; while (tree[now][1] != 0) { now = tree[now][2]; } } } else { if (tree[now][0] == 0) { tree[now][0] = index; tree[index][2] = now; now = index; index++; } else { tree[now][1] = index; tree[index][2] = now; now = index; index++; } } } cheight(); yess = true; isyes(); //for (int i=0; i < index; i++) // cout << tree[i][3] << " "; if (str[0] == '#') yess = true; if (yess) printf("Yes/n"); else printf("No/n"); } return 0; }