ayit第十周训练题e题

最新推荐文章于 2021-02-25 23:40:35 发布

hdy403

最新推荐文章于 2021-02-25 23:40:35 发布

阅读量541

点赞数

本文链接：https://blog.youkuaiyun.com/m0_46628834/article/details/105757714

版权

该博客介绍了如何根据给定的二叉树前序遍历和中序遍历序列，恢复二叉树并输出其后序遍历。题目提供了一组示例输入和期望的输出，解析了题目的要求和解决思路。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

最低0.47元/天解锁文章