zoukankan      html  css  js  c++  java
  • 03-树2 List Leaves (25 分)

    Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.

    Input Specification:

    Each input file contains one test case. For each case, the first line gives a positive integer N (≤) which is the total number of nodes in the tree -- and hence the nodes are numbered from 0 to N1. Then N lines follow, each corresponds to a node, and gives the indices of the left and right children of the node. If the child does not exist, a "-" will be put at the position. Any pair of children are separated by a space.

    Output Specification:

    For each test case, print in one line all the leaves' indices in the order of top down, and left to right. There must be exactly one space between any adjacent numbers, and no extra space at the end of the line.

    Sample Input:

    8
    1 -
    - -
    0 -
    2 7
    - -
    - -
    5 -
    4 6
    

    Sample Output:

    4 1 5
    #include<cstdio>
    #include<queue>
    using namespace std;
    const int maxn = 15;
    struct Node{
        int lchild,rchild;
    }node[maxn];
    int h[maxn],leaf[maxn],num = 0;
    bool isRoot[maxn];
    
    int charToint(char c){
        if(c == '-') return -1;
        else{
            isRoot[c-'0'] = false;
            //printf("isRoot[%d] == %d
    ",c-'0',isRoot[c-'0']);
            return c-'0';
        }
    }
    
    void print(int i){
        if(num == 0){
            printf("%d",i);
            num++;
        }    
        else printf(" %d",i);
    }
    
    void BFS(int root){
        queue<int> q;
        q.push(root);
        while(!q.empty()){
            //printf("1
    ");
            int now = q.front();
            q.pop();
            if(node[now].lchild == -1 && node[now].rchild == -1) print(now);
            if(node[now].lchild != -1) q.push(node[now].lchild);
            if(node[now].rchild != -1) q.push(node[now].rchild);
        }    
    }
    
    int main(){
        int n;
        scanf("%d
    ",&n);
        for(int i = 0; i < n; i++){
            isRoot[i] = true;
        }
        char a,b;
        for(int i = 0; i < n; i++){
            scanf("%c %c",&a,&b);
            getchar();
            int u = charToint(a);
            int v = charToint(b);
            node[i].lchild = u;
            node[i].rchild = v; 
        }
        int root;    
        for(int i = 0; i < n; i++){
            if(isRoot[i] == true) root = i;
        }
        //printf("root == %d
    ",root);
        
        BFS(root);
        return 0;
    }
  • 相关阅读:
    第01组-Alpha冲刺总结
    pypy windows安装scrapy
    Python:pip无法使用No module named '_sysconfigdata_m_linux_x86_64-linux-gnu'
    Jenkins+Ansible+Gitlab:通过curl自动推送文件&gitlab自动触发构建
    zabbix安装及问题小结
    虚拟机中的jenkins无法访问&Nginx配置
    centos7 安装gitlab及简单配置
    kerberos&LDAP实现免密码登录搭建
    kerberos&ssh 原理、免密登录搭建
    自启动脚本/etc/rc.local文件
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/10409364.html
Copyright © 2011-2022 走看看