#Leetcode# 109. Convert Sorted List to Binary Search Tree

最新推荐文章于 2024-09-16 17:51:29 发布

weixin_30710457

最新推荐文章于 2024-09-16 17:51:29 发布

阅读量40

点赞数

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/zlrrrr/p/10361998.html

版权

https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

Given the sorted linked list: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5

代码：

class Solution {
public:
    TreeNode* sortedListToBST(ListNode* head) {
        if (!head) return NULL;
        return helper(head, NULL);
    }
    TreeNode* helper(ListNode* head, ListNode* tail) {
        if (head == tail) return NULL;
        ListNode *slow = head, *fast = head;
        while (fast != tail && fast -> next != tail) {
            slow = slow -> next;
            fast = fast -> next -> next;
        }
        TreeNode *cur = new TreeNode(slow -> val);
        cur -> left = helper(head, slow);
        cur -> right = helper(slow -> next, tail);
        return cur;
    }
};

　　从中间找父亲节点递归

转载于:https://www.cnblogs.com/zlrrrr/p/10361998.html