赵二的刷题日记026《从前序与中序遍历构造二叉树》

最新推荐文章于 2024-10-06 20:16:20 发布

月神2019

最新推荐文章于 2024-10-06 20:16:20 发布

阅读量79

点赞数

分类专栏： LeetCode 文章标签：二叉树 java 算法

本文链接：https://blog.csdn.net/qq_20013333/article/details/118703588

版权

本文介绍了如何根据给定的前序和中序遍历数组重建二叉树。通过示例展示了具体的过程，涉及二叉树的构造及遍历算法。

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

Construct Binary Tree from Preorder and Inorder Traversal

Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree.

Example 1:

Input: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]
Output: [3,9,20,null,null,15,7]

Example 2:

Input: preorder = [-1], inorder = [-1]
Output: [-1]

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(in