construct-binary-tree-from-preorder-and-inorder-traversal

最新推荐文章于 2022-05-08 09:10:52 发布

damon guan

最新推荐文章于 2022-05-08 09:10:52 发布

阅读量94

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/u012389124/article/details/102616740

版权

算法专栏收录该内容

12 篇文章 0 订阅

订阅专栏

/**

* Definition for binary tree

* struct TreeNode {

* int val;

* TreeNode *left;

* TreeNode *right;

* TreeNode(int x) : val(x), left(NULL), right(NULL) {}

* };

*/

class Solution {

public:

TreeNode *buildTree(vector<int> &preorder, vector<int> &inorder) {

return buildTree(preorder, 0, preorder.size()-1, inorder, 0, inorder.size()-1);

}

private:

TreeNode *buildTree(vector<int>& preorder, int preLeft, int preRight, vector<int>& inorder, int inLeft, int inRight)

{

if (preRight<preLeft)

{

return NULL;

}

TreeNode* node = new TreeNode(preorder[preLeft]);

if(preRight == preLeft)

{

return node;

}

int num = 0;

for(int i = inLeft; i <= inRight; ++i)

{

if(inorder[i] == preorder[preLeft])

{

num = i;

break;

}

int length = num - inLeft;

node->left = buildTree(preorder, preLeft+1, preLeft+length, inorder, inLeft, inLeft+length-1);

node->right = buildTree(preorder, preLeft+length+1, preRight, inorder, num+1, inRight);

return node;

}

};

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

damon guan

关注关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
复制链接

分享到 QQ

分享到新浪微博

扫一扫

专栏目录

[LeetCode-21]Construct Binary Tree from Preorder and Inorder Traversal

coder 进阶的专栏

05-21

4211

Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree.

leetcode construct-binary-tree-from-preorder-and-inorder-traversal(Java)

聚沙成塔

05-12

276

leetcode题目 construct-binary-tree-from-inorder-and-preorder-traversal -- newcoder 43 从中序与后序遍历序列构造二叉树 -- leetcode 106 题目描述 Given inorder and postorder traversal of a tree, construct the binary tree. ...

参与评论您还未登录，请先登录后发表或查看评论

leetcode — construct-binary-tree-from-preorder-and-inorder-traversal

lack的专栏

02-28

215

import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * * Source : https://oj.leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ * * * Giv

105.construct-binary-tree-from-preorder-and-inorder-traversal

JanLEE

05-08

207

Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. class Solution(object): def buildTree(self, preorder, inorder): """ :type preorder: List[int].

LeetCode-construct-binary-tree-from-preorder-and-inorder-traversal

六月二十七的博客

04-02

124

Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. /** * Definition for binary tree * public class TreeNode...

【construct-binary-tree-from-preorder-and-inorder-traversal】

lplp90908的博客

09-09

297

Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. 前序和中序重构二叉树；这里用dfs的思想： class Solution { public:

leetcode练习题 construct-binary-tree-from-preorder-and-inorder-traversal

qq_38303368的博客

03-25

238

解题思路前序遍历第一个结点为根，在中序遍历中找到该结点，从而将中序遍历分为左右子树，准确定位左右子树在前序遍历中的起点和终点，之后递归建立左右子树，设置递归出口，最后返回根。代码 class Solution { public: TreeNode *buildTree(vector<int> &preorder,vector<int> &inor...

construct-binary-tree-from-preorder-and-inorder-traversal Java code

qq_29606255的博客

10-29

268

leetcode_construct-binary-tree-from-preorder-and-inorder-traversal

weixin_38554391的博客

12-29

题目链接 https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ 题目内容根据一棵树的前序遍历与中序遍历构造二叉树。注意: 你可以假设树中没有重复的元素。例如，给出前序遍历 preorder = [3,9,20,15,7] 中序遍历 inorder = [9,3,15,20,7] 返回如下的二叉树： 3 / 9 20 / 15 7 解题思路 1.用hash表存

Construct Binary Tree from Preorder and Inorder Traversal

10-24

Construct Binary Tree from Preorder and Inorder Traversal 根据先序，中序建立二叉树

105.construct binary tree from preorder and inorder traversal从前序和与中序遍历序列构造二叉树【LeetCode单题讲解系列】

08-31

105.construct_binary_tree_from_preorder_and_inorder_traversal从前序

个人记录-LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal

ZhangJian的博客

04-27

1174

LeetCode

Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal (python+cpp)

qq_37821701的博客

06-30

255

Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal题目解析题目解析观察前序遍历和中序遍历可以发现，前序遍历的第一个节点是根节点，从中序遍历中找到这个节点的位置，这个节点左边是左子树，右遍是右子树。根据这样的规律，我们可以用前序遍历的顺序作为索引，将中序遍历进行不断切分来构造树。递归函数的详情如下：新建一个全局变量preindex，代表在前序遍历中的位置，在递归过程中每次递归这个变量加1 递归函数接受两个参

两个有序数组中找到第k大的元素

u012389124的专栏

08-31

2726

1. 求第k大的数，可以定义两个游标(i,j)分别指向两个有序数组（a[], b[]），a[i] > b[j] 则j++，result= b[j];否则i++。移动一次则count++，当count等于k时，返回result。代码如下： #include <iostream> int getRankData(int a[], int aSize, int b[], i...

两个链表相加求和

u012389124的专栏

08-26

1552

你有两个用链表代表的整数，其中每个节点包含一个数字。数字存储按照在原来整数中相反的顺序，使得第一个数字位于链表的开头。写出一个函数将两个整数相加，返回和。若链表存储是从高位开始存储，则将链表先反转再相加。反转链表实现 #include<iostream> #include<sstream> #include<vector> struct Node {...

有一组不同高度的台阶，用一个整数数组表示，数组中每个数是台阶的高度，雨后（雨水足够多）台阶之间的水坑会积水多少呢？

u012389124的专栏

08-28

1105

如数组int height[] = {0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1}; 对应积水如下图：图转自：https://blog.csdn.net/Thomas0713/article/details/83051990 如果要形成积水，则积水两旁的台阶上高于积水区的。而积水体积计算则是最低台阶与两边台阶最低的差。代码： #include &lt...

通过循环遍历二叉树

u012389124的专栏

08-31

564

#include<iostream> #include<stack> struct Node { int data; Node* left; Node* right; Node() : data(0), left(NULL), right(NULL) {}; }; Node* buildHeap(int * a, int aSize)...

一个整型数组里除了一个数字之外，其他的数字都出现了两次，找出出现一次的数字

u012389124的专栏

01-16

516

当两个数字相同，则这两个数字异或得到0,0异或数字还是原来的数字。 #include int findunique(int *a,int len) { int result=0,i; for(i=0;i result=result^a[i]; return result; } void main() { int a[9]

Assume the postorder of binary tree T is RELATIONDB, the in order of T is REILTABOND,then the preorder of T will be