109. Convert Sorted List to Binary Search Tree LeetCode
2016-02-16 19:22
447 查看
题意：把排序好的链表转换成二叉搜索树。
题解：和把排序好的数组转换成二叉搜索树是一个思路，每次从中间分开。这里用slow和fast去找链表的中间节点。
题解：和把排序好的数组转换成二叉搜索树是一个思路，每次从中间分开。这里用slow和fast去找链表的中间节点。
class Solution {
public:
TreeNode* sortedListToBST(ListNode* head) {
if(head == NULL) return NULL;
if(head->next == NULL)
{
return new TreeNode(head->val);
}
ListNode *fast = head->next->next, *slow = head;
while(fast && fast->next)
{
fast = fast->next->next;
slow = slow->next;
}
ListNode *temp = slow->next;
TreeNode *ans = new TreeNode(temp->val);
slow->next = NULL;
ans->left = sortedListToBST(head);
ans->right = sortedListToBST(temp->next);
return ans;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解