前序和中序构建二叉树,层序遍历所构建的二叉树

题目:

题目:由前序和中序遍历构造出二叉树,再由层序遍历打印出来。
提出问题:这里面的所有元素的值都是不同的,如果相同会发生什么情况。

参考一:https://blog.csdn.net/K346K346/article/details/50970464

参考二:https://blog.csdn.net/ns_code/article/details/13169703

图片:

流程展示,代码未来有时间补上。

Construct binary tree.

p{1,2,4,7,3,5,6,8}    m{4,7,2,1,5,3,8,6}
find root0 on p {1} ,seperate m to {4,7,2}{5,3,8,6} 
                 according to m, seperate p to {2,3,7}and {3,5,6,8}

combine m{4,7,2} with p{2,4,7}
combine m{5,3,8,6} with p{3,5,6,8}

for 1: left
    find root1 on p is 2, seperate m to {4,7} and null 
                            seperate p to {4,7} and null
          for 2:
                combine m{4,7} with p{4,7}
                combine null with null

                for root2 on p is 4, seperate m to null and 7
                                        according to m, null and 7

                    for 3:
                        null and 7.

for 1: right  
    find root1 on p is 3 ,seperate m to {5} and {8,6}
                            according to m, {5},{6,8}
            for 2 :
                combine m{5} and p{5}
                combine m{8,6} and p{6,8}

                for root2 in p is {6}, and seperate m to {8} and null
                            according to m, p seperated to {8} and null

done.

Level travesal using array.
    // There need two pointers,left one is for travel on the roots,print and move
    // forword, Another one is for put left and right child to the array. Its 
    // function just like queue. I think this is why queue structure be created.
    root level 0
    get root0{1};
    root level 1
    get left{2}, get right{3}; store left and right.
        for left: 
            get left{4} and null; store left.
        for right:
            get left{5} and {6}; store left and right;
        
        root level 2
        for {4} :
            left null, right {7}, store right
        for {5} :
            left null, right null
        for {6} :
            left {8} ,right null ,store left

            root level 3
            for{7} :
                left null, right null;
            for{8} :
                left null, right null;
done.
    

Level travesal using queue.
    root level 0:
    put {1} to queue.
        root level 1:
        put{2} and {3} in queue, and release {1};

            root level 2:
            put{4} in queue, and release{2} ,put {5}{6} to queue and release{3}

                root level 3:
                put {7} in queue and release{4},release {5}, put {8} in queue and release {6}

                    root level 4:
                    release{7},release{8}

done.

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
好的,我知道你要求了。关于你的问题,以下是C语言用数组构建一颗二叉树,并分别完成前序遍历,中序遍历,后序遍历,层序遍历后输出遍历结果的代码: ``` #include <stdio.h> #define MAXSIZE 1024 typedef struct Node{ int data; struct Node *left; struct Node *right; }BiTreeNode; // 初始化二叉树结点 void Init_BiTree_Node(BiTreeNode* node, int data){ node -> data = data; node -> left = NULL; node -> right = NULL; } // 用数组构建一棵二叉树 void Create_BiTree(BiTreeNode* node, int arr[], int i, int len){ if (i > len){ return; } Init_BiTree_Node(node, arr[i - 1]); if (2 * i <= len){ node -> left = (BiTreeNode*)malloc(sizeof(BiTreeNode)); Create_BiTree(node -> left, arr, 2 * i, len); } if (2 * i + 1 <= len){ node -> right = (BiTreeNode*)malloc(sizeof(BiTreeNode)); Create_BiTree(node -> right, arr, 2 * i + 1, len); } } // 前序遍历 void PreOrderTraverse(BiTreeNode* node){ if (node != NULL){ printf("%d ", node -> data); PreOrderTraverse(node -> left); PreOrderTraverse(node -> right); } } // 中序遍历 void InOrderTraverse(BiTreeNode* node){ if (node != NULL){ InOrderTraverse(node -> left); printf("%d ", node -> data); InOrderTraverse(node -> right); } } // 后序遍历 void PostOrderTraverse(BiTreeNode* node){ if (node != NULL){ PostOrderTraverse(node -> left); PostOrderTraverse(node -> right); printf("%d ", node -> data); } } // 层序遍历 void LevelOrderTraverse(BiTreeNode* root){ BiTreeNode* queue[MAXSIZE]; int front = 0, rear = 0; if(root){ queue[rear++] = root; } while(front != rear){ BiTreeNode* p = queue[front++]; printf("%d ", p -> data); if(p -> left){ queue[rear++] = p -> left; } if(p -> right){ queue[rear++] = p -> right; } } } int main(){ // 定义一个数组 int arr[7] = {1, 2, 3, 4, 5, 6, 7}; // 构建二叉树 BiTreeNode *root = (BiTreeNode*)malloc(sizeof(BiTreeNode)); Create_BiTree(root, arr, 1, 7); // 前序遍历并输出结果 printf("Pre-order traversal:\n"); PreOrderTraverse(root); printf("\n"); // 中序遍历并输出结果 printf("In-order traversal:\n"); InOrderTraverse(root); printf("\n"); // 后序遍历并输出结果 printf("Post-order traversal:\n"); PostOrderTraverse(root); printf("\n"); // 层序遍历并输出结果 printf("Level-order traversal:\n"); LevelOrderTraverse(root); return 0; } ``` 希望这段代码能够解决你的问题。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值