zoukankan      html  css  js  c++  java
  • 二叉树

    A binary tree is a finite set of vertices that is either empty or consists of a root r and two disjoint binary trees called the left and right subtrees. There are three most important ways in which the vertices of a binary tree can be systematically traversed or ordered. They are preorder, inorder and postorder. Let T be a binary tree with root r and subtrees T1,T2.

    In a preorder traversal of the vertices of T, we visit the root r followed by visiting the vertices of T1 in preorder, then the vertices of T2 in preorder.

    In an inorder traversal of the vertices of T, we visit the vertices of T1 in inorder, then the root r, followed by the vertices of T2 in inorder.

    In a postorder traversal of the vertices of T, we visit the vertices of T1 in postorder, then the vertices of T2 in postorder and finally we visit r.

    Now you are given the preorder sequence and inorder sequence of a certain binary tree. Try to find out its postorder sequence.

    InputThe input contains several test cases. The first line of each test case contains a single integer n (1<=n<=1000), the number of vertices of the binary tree. Followed by two lines, respectively indicating the preorder sequence and inorder sequence. You can assume they are always correspond to a exclusive binary tree.
    OutputFor each test case print a single line specifying the corresponding postorder sequence.
    Sample Input
    9
    1 2 4 7 3 5 8 9 6
    4 7 2 1 8 5 9 3 6
    Sample Output
    7 4 2 8 9 5 6 3 1

    代码示例 :
    using namespace std;
    const int eps = 1e6+5;
    const int maxn = 0x3f3f3f3f;
    #define ll long long
    
    typedef struct node
    {
        int data;
        struct node *lchild, *rchild;
    }bitnode, *bitree;
    
    int vis[1005];
    int a[1005], b[1005];
    int sign;
    int n;
    
    void build(bitree *T, int l, int r) {
        int p;
        for(int i = 0; i < n; i++) {
            sign = 0;
            if (!vis[a[i]]) {
                for(int j = l; j <= r; j++){
                    if (a[i] == b[j]) {
                        p = j;
                        sign = 1;
                        vis[a[i]] = 1; 
                        break;
                    }
                }
            }
            if (sign) break;
        }
        if (!sign) return;
        //printf(" p = %d 
    ", b[p]);
        (*T) = (bitree)malloc(sizeof(bitnode));
        (*T)->data = b[p];
        (*T)->lchild = (*T)->rchild = NULL;
        build(&(*T)->lchild, l, p-1);
        build(&(*T)->rchild, p+1, r);
    }
    
    void order(bitree T, bitree p){
        if (T) { 
            order(T->lchild, p); 
            order(T->rchild, p);
            printf("%d%c", T->data, T==p?'
    ':' ');  
        }
    }
    
    int main() {
        bitree T;
        
        while(~scanf("%d", &n)) {
            memset(vis, 0, sizeof(vis));
            for(int i = 0; i < n; i++) scanf("%d", &a[i]);
            for(int i = 0; i < n; i++) scanf("%d", &b[i]);
            build(&T, 0, n-1);
            order(T, T); 
        }
        return 0;
    }
    


    东北日出西边雨 道是无情却有情
  • 相关阅读:
    Java 中的四种引用
    vue 移动端的开发
    使用java语言实现一个动态数组(详解)(数据结构)
    深度长文回顾web基础组件
    告诉你如何回答"线上CPU100%排查"面试问题
    超实用的mysql分库分表策略,轻松解决亿级数据问题
    【源码解析】凭什么?spring boot 一个 jar 就能开发 web 项目
    java中的守护线程
    Excel导入导出工具(简单、好用且轻量级的海量Excel文件导入导出解决方案.)
    spring-data-redis-cache 使用及源码走读
  • 原文地址:https://www.cnblogs.com/ccut-ry/p/8301448.html
Copyright © 2011-2022 走看看