编程介的小学生
2018-11-06 15:40
采纳率: 92.5%
浏览 1.6k
已采纳

C语言构造二叉树的问题,二叉树从键盘的输入

Description

Little Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes.
This is an example of one of her creations:

                                           D

                                          / \

                                         /   \

                                        B     E

                                       / \     \

                                      /   \     \

                                     A     C     G

                                                /

                                               /

                                              F

To record her trees for future generations, she wrote down two strings for each tree: a preorder traversal (root, left subtree, right subtree) and an inorder traversal (left subtree, root, right subtree). For the tree drawn above the preorder traversal is DBACEGF and the inorder traversal is ABCDEFG.
She thought that such a pair of strings would give enough information to reconstruct the tree later (but she never tried it).

Now, years later, looking again at the strings, she realized that reconstructing the trees was indeed possible, but only because she never had used the same letter twice in the same tree.
However, doing the reconstruction by hand, soon turned out to be tedious.
So now she asks you to write a program that does the job for her!

Input

The input will contain one or more test cases.
Each test case consists of one line containing two strings preord and inord, representing the preorder traversal and inorder traversal of a binary tree. Both strings consist of unique capital letters. (Thus they are not longer than 26 characters.)
Input is terminated by end of file.

Output

For each test case, recover Valentine's binary tree and print one line containing the tree's postorder traversal (left subtree, right subtree, root).
Sample Input

DBACEGF ABCDEFG
BCAD CBAD
Sample Output

ACBFGED
CDAB

  • 写回答
  • 好问题 提建议
  • 关注问题
  • 收藏
  • 邀请回答

2条回答 默认 最新

  • threenewbee 2018-11-23 14:45
    已采纳
    已采纳该答案
    评论
    解决 无用
    打赏 举报
  • wudengyu 2018-11-07 12:45

    #include
    #include
    #include

    typedef struct node
    {
    char value;
    struct node* left;
    struct node* right;
    }tree;
    tree* binarytree(char* preord,char* inord,int length)
    {
    if (length < 1)
    return NULL;
    tree* tmp=(tree*)malloc(sizeof(tree));
    tmp->value = preord;
    tmp->left = NULL;
    tmp->right = NULL;
    if (length != 1)
    {
    char
    point = strchr(inord, preord);
    int l = point - inord;
    tmp->left = binarytree(preord + 1, inord, l);
    tmp->right = binarytree(preord + l+1, point+1, length - l - 1);
    }
    return tmp;
    }
    void postorder(tree
    postord)
    {
    if (postord->left != NULL)
    postorder(postord->left);
    if(postord->right!=NULL)
    postorder(postord->right);
    printf("%c", postord->value);
    }
    void main()
    {
    char line[100][100];
    int i = 0;
    char *preord;
    char *inord;
    while (strlen(gets(line[i])) != 0)
    {
    i++;
    }
    for (int j = 0; j < i; j++) {
    preord = strtok(line[j], " ");
    inord = strtok(NULL, " ");
    postorder(binarytree(preord, inord, strlen(preord)));
    printf("\n");
    }
    }

    评论
    解决 无用
    打赏 举报

相关推荐 更多相似问题