欧美三区_成人在线免费观看视频_欧美极品少妇xxxxⅹ免费视频_a级毛片免费播放_鲁一鲁中文字幕久久_亚洲一级特黄

1101-Trees on the Level

系統 1701 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元、自定義金額等您想捐的金額吧,站長會非常 感謝您的哦!!!

發表我的評論
最新評論 總共0條評論
主站蜘蛛池模板: 国产成人激情视频 | 久久国产天堂福利天堂 | 亚洲制服丝袜 | 日本亚洲成人 | 手机在线观看你懂得 | 久久久无码精品成人A片小说 | 99视频观看| 青草悠悠视频在线观看 | 男女激情爱爱 | www.亚洲黄色 | hdfreexxxx中国妞| 国产精品视频免费一区二区三区 | 夜夜狠狠操 | 哥斯拉大战金刚2在线观看免费完整版 | 日韩成人在线播放 | 国产大片免费观看中文字幕 | 91视频免费观看高清观看完整 | 日本在线免费观看视频 | 色屁屁www免费看视频影院 | 香蕉久草视频 | 精品一二区 | 亚洲国产欧美91 | 琪琪色在线视频 | 国产女人久久精品 | 伊人久久国产精品 | 日本黄大片影院一区二区 | 日本黄页网址 | 成人免费一区二区三区视频网站 | 97国产精品 | 久草久草久草 | 91av官网| 亚洲电影一区二区三区 | 中文字幕在线精品 | 亚洲精品麻豆 | 97爱爱爱 | 亚洲成a人v大片在线观看 | 久久99国产综合精品免费 | 性做久久久久久免费观看欧美 | 色网站综合 | 欧美四虎 | 一级黄色大毛片 |