[leetcode]Convert Sorted List to Binary Search Tree
2015-04-12 20:29
260 查看
题目大意：将一个有序链表转化为一颗平衡二叉树
题目分析：用递归和二分实现，可以将创建树的过程视为中序遍历一棵树的逆过程（链表即为中序遍历二叉树的结果。）。中序遍历时，首先要访问最左下的叶节点，那就首先创建该节点，然后创建它的父节点，再创建它的兄弟右节点。注意：要首先求出链表的长度，以便于二分地递归。
题目分析：用递归和二分实现，可以将创建树的过程视为中序遍历一棵树的逆过程（链表即为中序遍历二叉树的结果。）。中序遍历时，首先要访问最左下的叶节点，那就首先创建该节点，然后创建它的父节点，再创建它的兄弟右节点。注意：要首先求出链表的长度，以便于二分地递归。
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode: Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree leetcode java
- [LeetCode] Convert Binary Search Tree to Sorted Doubly Linked List 将二叉搜索树转为有序双向链表
- [Leetcode]Convert Sorted List to Binary Search Tree
- [leetcode] Convert Sorted List to Binary Search Tree
- LeetCode-Convert Sorted List to Binary Search Tree
- [LeetCode]Convert Sorted List to Binary Search Tree
- LeetCode 109 Convert Sorted List to Binary Search Tree
- 【leetcode】Convert Sorted List to Binary Search Tree
- leetcode_question_109 Convert Sorted List to Binary Search Tree
- 【leetcode】Convert Sorted Array/List to Binary Search Tree
- [leetcode刷题系列]Convert Sorted List to Binary Search Tree
- Leetcode 109 Convert Sorted List to Binary Search Tree 有序单链表构造平衡二插查找树
- LeetCode ---Convert Sorted List to Binary Search Tree
- LeetCode解题报告——Convert Sorted List to Binary Search Tree & Populating Next Right Pointers in Each Node & Word Ladder
- 【Leetcode】Convert Sorted List to Binary Search Tree (BST)
- [LeetCode 题解]:Convert Sorted List to Binary Search Tree
- [LeetCode109]Convert Sorted List to Binary Search Tree
- LeetCode Convert Sorted List to Binary Search Tree
- [leetcode]Convert Sorted List to Binary Search Tree