[leetcode]Construct Binary Tree from Inorder and Postorder Traversal (利用中序遍历和后续遍历确定一颗二叉树)
来源:互联网 发布:opencv分水岭分割算法 编辑:程序博客网 时间:2024/05/17 20:34
Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
题意:给出一个中序遍历和后序遍历数的结果,求这棵二叉树。
Notes:你可以假设这棵树是唯一的。
解题思路:
对于后序遍历:先从叶子节点开始遍历,左叶子节点->右叶子节点->根节点
对于中序遍历:左叶子节点->根节点->右叶子节点
对于前序遍历:根节点->左叶子节点->右叶子节点
例如: 4
2 6
1 3 5 7
后续遍历:1325764
中序遍历:1234567
前序遍历:4213657
前序遍历+后序遍历可以唯一确定一棵二叉数。 中序遍历+后序遍历可以唯一确定一棵二叉树。
中序遍历+后序遍历:后续遍历的最后一个节点是整个二叉树Tree1的根节点,这样可以找到中序遍历的根节点,从而可以知道中序遍历中根节点值的左边属于左子树Tree2,中序遍历根节点的右边属于右子树Tree3.
以此类推:Tree2,Tree3子树也可以采用中序遍历和后序遍历,同上继续细分下去,最后得到一颗唯一的二叉树。
具体推断过程如下:
依次类推,并递归下去,就可以建立一颗二叉树了。
C语言实现代码如下:
/*** struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */struct TreeNode *buildTree(int *inorder, int *postorder, int n) { int i; struct TreeNode *tree; if(n > 0){ tree = (struct TreeNode *)malloc(sizeof(struct TreeNode)); tree->val = postorder[n-1]; for(i = 0; i < n; i++){ if(inorder[i] == postorder[n-1]){ break; } } tree->left = buildTree(inorder,postorder,i); tree->right = buildTree(inorder+i+1,postorder+i,n-i-1); }else{ tree = NULL; } return tree;}
- [leetcode]Construct Binary Tree from Inorder and Postorder Traversal (利用中序遍历和后续遍历确定一颗二叉树)
- 【LeetCode】Construct Binary Tree From Inorder And Postorder Traversal 中序遍历和后序遍历树构造二叉树
- Construct Binary Tree from Inorder and Postorder Traversal 中序和后序遍历二叉树
- LeetCode(Construct Binary Tree from Inorder and Postorder Traversal)根据二叉树的中序和后续构造二叉树
- LeetCode-106:Construct Binary Tree from Inorder and Postorder Traversal (利用中序和后序遍历构建二叉树) -- medium
- [LintCode] 中序遍历和后序遍历树构造二叉树 Construct Binary Tree from Inorder and Postorder Traversal
- lintcode construct-binary-tree-from-inorder-and-postorder-traversal 中序遍历和后序遍历树构造二叉树
- Construct Binary Tree from Inorder and Postorder Traversal 利用中序遍历和后序遍历构造树
- Leetcode - Tree - 106. Construct Binary Tree from Inorder and Postorder Traversal(根据中序遍历和后序遍历重构二叉树)
- 【LeetCode笔记】Construct Binary Tree from Inorder and Postorder Traversal 中序、后序遍历求二叉树
- leetCode 106.Construct Binary Tree from Inorder and Postorder Traversal (根据中序遍历和后序遍历构造二叉树)
- LeetCode 106. Construct Binary Tree from Inorder and Postorder Traversal(根据中序遍历和后序遍历构造二叉树)
- Leetcode Construct Binary Tree from Inorder and Postorder Traversal 中序后序遍历重组二叉树
- [leetcode]Construct Binary Tree from Preorder and Inorder Traversal(根据前序、中序遍历确定一棵二叉树 C语言)
- 72.Construct Binary Tree from Inorder and Postorder Traversal-中序遍历和后序遍历树构造二叉树(中等题)
- 利用二叉树的中序遍历和后序遍历序列构造一个二叉树Search results for Construct Binary Tree from Inorder and Postorder Traversa
- LeetCode-105:Construct Binary Tree from Preorder and Inorder Traversal (利用先序和中序遍历构建二叉树) -- medium
- Construct Binary Tree from Inorder and Postorder Traversal 中序和后序重建二叉树
- 并查集 codeforces party
- iOS CAAnimationGroup
- Windows系统下Memcached缓存系列二:CouchbaseClient(c#客户端)的详细试用,单例模式
- Using CEDET and ECB with Emacs
- System.out.print与System.out.println的区别
- [leetcode]Construct Binary Tree from Inorder and Postorder Traversal (利用中序遍历和后续遍历确定一颗二叉树)
- node.js中结合redis实现session
- 《程序员修炼之道:从小工到专家》读书笔记
- mac+virtualbox+centos7+docker搭建lnmp环境
- \n与\r的区别
- Using GitHub for Windows with non-GitHub repositories
- [leetcode]Convert Sorted Array to Binary Search Tree (有序数组转化为二叉搜索树 C语言)
- poj 1284 Primitive Roots 求素数元根数
- ARM ADS1.2 卸载后重装安装不上的问题