Construct Binary Tree from Preorder and Inorder Traversal

最新推荐文章于 2021-11-20 22:20:24 发布
最新推荐文章于 2021-11-20 22:20:24 发布
阅读量148 收藏
点赞数
分类专栏： LeetCode
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/jambee/article/details/40859717
版权 
/**
 * 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) {
        if (inorder.size() == 0)
            return NULL;
            
        TreeNode *head = createTreePro(preorder, 0, preorder.size() - 1, inorder, 0, inorder.size() - 1);
        
        return head;
    }
    TreeNode *createTreePro(vector<int> &preorder,int preBeg,int preEnd,vector<int> &inorder,int inBeg,int inEnd){
	if(preBeg>preEnd)
		return NULL;
	int root=preorder[preBeg];

	int index;
	for (int i=inBeg;i<=inEnd;i++)
	{
		if (inorder[i]==root)
		{
			index=i;
			break;
		}
	}

	int len=index-inBeg;
	TreeNode *left=createTreePro(preorder,preBeg+1,preBeg+len,inorder,inBeg,index-1);
	TreeNode *right=createTreePro(preorder,preBeg+len+1,preEnd,inorder,index+1,inEnd);

	TreeNode *node=new TreeNode(root);
	node->left=left;
	node->right=right;
	return node;
}
};

jambee
关注
专栏目录
Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal (python+cpp)
qq_37821701的博客
06-30 264
Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal题目解析 题目 解析 观察前序遍历和中序遍历可以发现，前序遍历的第一个节点是根节点，从中序遍历中找到这个节点的位置，这个节点左边是左子树，右遍是右子树。根据这样的规律，我们可以用前序遍历的顺序作为索引，将中序遍历进行不断切分来构造树。递归函数的详情如下： 新建一个全局变量preindex，代表在前序遍历中的位置，在递归过程中每次递归这个变量加1 递归函数接受两个参
LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal（二叉树）
da_kao_la的博客
04-05 289
题目来源：https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ 问题描述 105.Construct Binary Tree from Preorder and Inorder Traversal Medium 155841FavoriteShare Given ...
105. Construct Binary Tree from Preorder and Inorder Traversal
猫敷雪
06-21 323
题目描述（中等难度） 根据二叉树的先序遍历和中序遍历还原二叉树。 解法一 递归 先序遍历的顺序是根节点，左子树，右子树。中序遍历的顺序是左子树，根节点，右子树。 所以我们只需要根据先序遍历得到根节点，然后在中序遍历中找到根节点的位置，它的左边就是左子树的节点，右边就是右子树的节点。 生成左子树和右子树就可以递归的进行了。 比如上图的例子，我们来分析一下。 preorder = [3,9,20,15,7] inorder = [9,3,15,20,7] 首先根据 preorder 找到根节点是 3 然后根
Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal（详细解析）
xue1236的博客
12-18 276
Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal 题目链接： Construct Binary Tree from Preorder and Inorder Traversal 难度：Medium 题目大意： 根据一棵二叉树中序遍历和前序遍历的结果恢复出二叉树。 思路： 这道题与leetcode上另一道题很像，参考我的另一篇博文Leetcode 106. Construct Binary Tree from In
【leetcode-Python】-树-105. Construct Binary Tree from Preorder and Inorder Traversal
gulaixiangjuejue的博客
03-18 225
题目链接 https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ 题目描述 根据一棵树的前序遍历和中序遍历构造二叉树。二叉树中不包含重复元素。 示例 输入：preorder=[3,9,8,6,7]，inorder = [9,3,6,8,7] 输出： [3,9,8,null,null,6,7] 解题思路 这道题首先需要根据前序遍历和中序遍历的结果找到根节点，然后找出
Construct Binary Tree from Preorder and Inorder Traversal（C++从前序与中序遍历序列构造二叉树）
coolsunxu的博客
07-06 138
Construct Binary Tree from Preorder and Inorder Traversal（C++从前序与中序遍历序列构造二叉树）
《中英双解》leetCode Construct Binary Tree from Preorder and Inorder Traversal(从前序到中序序列构建二叉树)
weixin_46272350的博客
11-20 260
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. 给定一棵树的前序遍历preorder与中序遍历inorder。请构造二叉树并返回其根节点 Example...
LeetCode - Medium - 105. Construct Binary Tree from Preorder and Inorder Traversal
KISS
06-14 355
Topic Array Tree Depth-first Search Description https://leetcode.com/problems/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 i
LeetCode105. Construct Binary Tree from Preorder and Inorder Traversal （思路及python解法）
AIpush的博客
12-10 294
Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. For example, given preorder =[3,9,20,15,7] inorder = [9,3...
105.construct binary tree from preorder and inorder traversal从前序和与中序遍历序列构造二叉树【LeetCode单题讲解系列】
08-31
105.construct_binary_tree_from_preorder_and_inorder_traversal从前序
Add Binary
jambee的专栏
10-22 261
class Solution { public: string addBinary(string a, string b) { string c; int ai = a.length()-1; int bi = b.length()-1; int ml = ai>bi?ai:bi; int q = 0; for(int i=0;i<=ml;i++,ai--,bi-
Rotate List
jambee的专栏
10-29 222
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode *ro
Sort List
jambee的专栏
10-29 216
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode *mergeT
Remove Element
jambee的专栏
10-21 207
class Solution { public: int removeElement(int A[], int n, int elem) { int index = 0; for(int i=0;i<n;i++){ if(A[i] != elem) A[index++] = A[i]; }
String to Integer (atoi)
jambee的专栏
10-23 201
class Solution { public: int atoi(const char *str) { if(str == NULL) return 0; if(*str == '\0') return 0; long long res = 0; //去除空格 while(*str == ' ') str++; bool ispositive = t
Integer to Roman
jambee的专栏
10-24 194
class Solution { public: string cc(int num){ if(num=0){ switch(num){ case 0: return "";break; case 1: return "I";break; case 2: return "II";break; case 3: return "III";break; case 4: retu
Sqrt(x)
jambee的专栏
10-24 193
class Solution { public: int sqrt(int x) { if(x<0) return -1; if(x=0) return 0; int left = 0; int right = x; long long mid = 0;
Assume the postorder of binary tree T is RELATIONDB, the in order of T is REILTABOND,then the preorder of T will be
最新发布
05-02
To determine the preorder of T, we need to first identify the root of the binary tree. In an inorder traversal of a binary tree, the nodes to the left of the root correspond to the left subtree of the root, and the nodes to the right of the root correspond to the right subtree of the root. From the given inorder sequence REILTABOND, we can see that the root of the binary tree T is "L". Next, we need to determine the left and right subtrees of the root. Since the postorder traversal of T is RELATIONDB, we know that the last element "B" is the root of the right subtree of "L". To find the root of the left subtree of "L", we need to look for the last element in the postorder sequence that appears before "B" in the inorder sequence. From the inorder sequence REILTABOND, we can see that the last element before "B" is "T". Therefore, "T" is the root of the left subtree of "L". Now we can construct the preorder traversal of T by starting at the root "L" and recursively traversing the left and right subtrees in preorder. The preorder traversal of T is: - Root: L - Left subtree: T, R, E, I, L, A - Right subtree: B, O, N, D Therefore, the preorder of T is LTRIELABOND.
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值