leetcode-889-Construct Binary Tree from Preorder and Postorder Traversal

最新推荐文章于 2022-08-15 06:08:33 发布

原创最新推荐文章于 2022-08-15 06:08:33 发布 · 148 阅读

0 ·

CC 4.0 BY-SA版权

算法专栏收录该内容

185 篇文章

订阅专栏

本文深入探讨了二叉树的前序和后序遍历模式，解析了如何通过根节点定位左子树和右子树的根节点，提供了一种有效的方法来理解二叉树的结构。

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

Get the pattern from it, 1) We know that in pre-order: [root, left, right], in post-order: [left, right, root] 2) so that root + 1 in pre-order must be the root of left subtree, root - 1 in post-order must be the root of right subtree. 3) call a function(pre_root, post_root, size), which get the root of pre and post array, and the size of the function. In the function, find the root of left and right subtree.

Error:
N/A