（二叉树存储+递归遍历）Binary Tree Traversals

最新推荐文章于 2022-02-26 19:51:19 发布

每天学点

最新推荐文章于 2022-02-26 19:51:19 发布

阅读量384

点赞数

分类专栏： C/C++/Python/Java/Matlab

请勿用于任何商业用途；转载的话请加上我的地址；

本文链接：https://blog.csdn.net/qq_40828914/article/details/81383819

版权

C/C++/Python/Java/Matlab 同时被 2 个专栏收录

291 篇文章 56 订阅 ¥39.90 ¥99.00

订阅专栏

C/C++

217 篇文章 13 订阅

订阅专栏

该博客介绍了如何根据先序和中序遍历序列来构建二叉树并求解后序遍历序列。通过分析遍历的性质，确定根节点并递归构建左右子树，最终输出后序序列。示例给出了一个包含9个节点的二叉树，其先序和中序遍历序列，以及对应的后序遍历序列。

摘要由CSDN通过智能技术生成

题目：

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 o

了解本专栏