亚洲免费在线-亚洲免费在线播放-亚洲免费在线观看-亚洲免费在线观看视频-亚洲免费在线看-亚洲免费在线视频

1101-Trees on the Level

系統 1612 0

描述

?

Trees are fundamental in many branches of computer science. Current state-of-the art parallel computers such as Thinking Machines' CM-5 are based on fat trees. Quad- and octal-trees are fundamental to many algorithms in computer graphics. This problem involves building and traversing binary trees. Given a sequence of binary trees, you are to write a program that prints a level-order traversal of each tree. In this problem each node of a binary tree contains a positive integer and all binary trees have fewer than 256 nodes. In a level-order traversal of a tree, the data in all nodes at a given level are printed in left-to-right order and all nodes at level k are printed before all nodes at level k+1. For example, a level order traversal of the tree

is: 5, 4, 8, 11, 13, 4, 7, 2, 1.

In this problem a binary tree is specified by a sequence of pairs (n,s) where n is the value at the node whose path from the root is given by the string s. A path is given be a sequence of L's and R's where L indicates a left branch and R indicates a right branch. In the tree diagrammed above, the node containing 13 is specified by (13,RL), and the node containing 2 is specified by (2,LLR). The root node is specified by (5,) where the empty string indicates the path from the root to itself. A binary tree is considered to be completely specified if every node on all root-to-node paths in the tree is given a value exactly once.

?

輸入

The input is a sequence of binary trees specified as described above. Each tree in a sequence consists of several pairs (n,s) as described above separated by whitespace. The last entry in each tree is (). No whitespace appears between left and right parentheses.
All nodes contain a positive integer. Every tree in the input will consist of at least one node and no more than 256 nodes. Input is terminated by end-of-file.

輸出

For each completely specified binary tree in the input file, the level order traversal of that tree should be printed. If a tree is not completely specified, i.e., some node in the tree is NOT given a value or a node is given a value more than once, then the string ``not complete'' should be printed.

樣例輸入

(11,LL) (7,LLL) (8,R)

(5,) (4,L) (13,RL) (2,LLR) (1,RRR) (4,RR) ()

(3,L) (4,R) ()

樣例輸出

5 4 8 11 13 4 7 2 1

not complete

      #include <iostream>

#include <queue>

using namespace std;



typedef struct tNode{

    int data;

    struct tNode *lchild, *rchild;

    tNode()

    {

        lchild = rchild = NULL;

        data = -9999999;

    }

}*Node;

bool flag;

class Tree{

private:

    Node root;

public:

    Tree()

    {

        root = new tNode();

    }

    void insert(int data, char path[]); //????????????

    void print(int d); //??????

    void destory(); //????????????

    bool isBitTree(); //????????????????????????

};



void Tree::insert(int data, char path[])

{

    int len = strlen(path);

    int i;

    Node cur = root;

    for(i = 0; i < len - 1; i++)

    {

        if(path[i] == 'L')

        {

            if(cur->lchild == NULL)

                cur->lchild = new tNode();

            cur = cur->lchild;

        }else if(path[i] == 'R')

        {

            if(cur->rchild == NULL)

                cur->rchild = new tNode();

            cur = cur->rchild;

        }

    }

    if(cur->data == -9999999)

        cur->data = data;

    else

        flag = false;

}

bool Tree::isBitTree()

{

    queue<Node> q;

    q.push(root);

    while(!q.empty())

    {

        Node cur = q.front();

        q.pop();

        if(cur->data == -9999999)

            return false;

        if(cur->lchild)

            q.push(cur->lchild);

        if(cur->rchild)

            q.push(cur->rchild);

    }

    return true;

}

void Tree::destory()

{

    queue<Node> q;

    q.push(root);

    while(!q.empty())

    {

        Node cur = q.front();

        q.pop();

        if(cur->lchild)

            q.push(cur->lchild);

        if(cur->rchild)

            q.push(cur->rchild);

        delete cur;

    }

    root = new tNode();

}

void Tree::print(int d)

{

    queue<Node> q;

    q.push(root);

    int w = 0;

    while(!q.empty())

    {

        Node cur = q.front();

        q.pop();

        if(w == d - 1)

            cout<<cur->data;

        else

            cout<<cur->data<<" ";

        if(cur->lchild)

            q.push(cur->lchild);

        if(cur->rchild)

            q.push(cur->rchild);

        w++;

    }

    cout<<endl;

}

int main()

{

    char snode[600];

    int data, d = 0;

    Tree t;

    flag = true;

    while(cin>>snode)

    {

        if(strcmp(snode, "()") == 0)

        {

            if(t.isBitTree() && flag)

                    t.print(d);

            else

                cout<<"not complete"<<endl;

            t.destory();

            d = 0;

            flag = true;

            continue;

        }

        sscanf(snode + 1, "%d", &data);

        t.insert(data, strchr(snode, ',') + 1);

        d++;

    }

    return 0;

}


    

1101-Trees on the Level


更多文章、技術交流、商務合作、聯系博主

微信掃碼或搜索:z360901061

微信掃一掃加我為好友

QQ號聯系: 360901061

您的支持是博主寫作最大的動力,如果您喜歡我的文章,感覺我的文章對您有幫助,請用微信掃描下面二維碼支持博主2元、5元、10元、20元等您想捐的金額吧,狠狠點擊下面給點支持吧,站長非常感激您!手機微信長按不能支付解決辦法:請將微信支付二維碼保存到相冊,切換到微信,然后點擊微信右上角掃一掃功能,選擇支付二維碼完成支付。

【本文對您有幫助就好】

您的支持是博主寫作最大的動力,如果您喜歡我的文章,感覺我的文章對您有幫助,請用微信掃描上面二維碼支持博主2元、5元、10元、自定義金額等您想捐的金額吧,站長會非常 感謝您的哦?。。?/p>

發表我的評論
最新評論 總共0條評論
主站蜘蛛池模板: 国产一区二区精品久久91 | 国产精品福利视频免费观看 | 四虎影院在线网址 | 97久久精品人人澡人人爽 | 伊人久久网国产伊人 | 色婷婷久久综合中文久久一本` | 青青青青久在线观看视频 | 免费特黄一级欧美大片 | 香蕉午夜 | 松永纱奈在线观看 | 免费观看成人www精品视频在线 | 久久久免费精品视频 | 国产欧美二区 | 国产精品成在线观看 | 九九精品在线 | 久久在线免费 | 国产这里只有精品 | 999视频在线观看 | 国产福利短视频 | 欧美色穴| 在线观看人成午夜影片 | 日日夜夜免费精品视频 | a毛片免费在线观看 | 欧美交换乱理伦片120秒 | 日韩中字在线 | 色伊伊| 99re热视频精品首页 | 看看一级毛片 | 国产色网址 | 久久亚洲日本不卡一区二区 | 伊人色综 | 毛片破处| 亚洲一级色 | 激情亚洲婷婷 | 天天干天天拍天天射天天添天天爱 | 国产亚洲精品久久久久久小说 | 久久日本精品99久久久 | 欧美性精品不卡在线观看 | 免费看欧美一级a毛片 | 亚洲精品影院 | 久久精品国产一区二区三区日韩 |