UVa 11234 Expressions (二叉树重建&由叶往根的层次遍历)(二)
)
{
int t, i, top, len;
Node* root;
scanf("%d\n", &t);
while (t--)
{
memset(node, 0, sizeof(node));
gets(s);
top = 0, len = strlen(s);
for (i = 0; i < len; ++i)
{
node[i].ch = s[i];
if (islower(s[i]))
stack[top++] = &node[i];
else
{
node[i].right = stack[--top];
node[i].left = stack[--top];
stack[top++] = &node[i];
}
}
root = &node[len - 1];
bfs(root);
}
return 0;
}