DS二叉树--层次遍历

 

样例输入

2

AB0C00D00

ABCD00E000FG00H0I00

样例输出

ABDC

ABFCGHDEI

#include <string>
#include <string.h>
#include <queue>
#include <iostream>
using namespace std;
  
class Node
{
public:
    char data;
    Node *left, *right;
    Node(){}
    ~Node()
    {
        delete left;
        delete right;
    }
};
   
static int i = 0;
Node *creattree(string str)
{
    Node *p = NULL;
    if(str[i] != '0')
    {
        p = new Node;
        p->data = str[i];
        i++;
        p->left = creattree(str);
        i++;
        p->right = creattree(str);
    }
    return p;
}
int main()
{
    queue<Node*> *q = new queue<Node*>;
    int T;
    string str;
    cin >> T;
    while(T--)
    {
        i = 0;
        Node *tree;
        Node *p;
        cin >> str;
        tree = creattree(str);
        q->push(tree);
        while(!q->empty())
        {
            p = q->front();
            cout << p->data;
            q->pop();
            if(p->left)
                q->push(p->left);
            if(p->right)
                q->push(p->right);
        }
        cout << endl;
        delete tree;
    }
    return 0;
}