LeetCode OJ:Convert Sorted List to Binary Search Tree

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.

算法思想：

可以不用定位到中间的节点，只要对链表进行处理就好了，关键步骤在于，head=head->next的处理

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
/**
 * 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 *BST(ListNode* &head,int start,int end){
        if(start>end)return NULL;
        int mid=(start+end)/2;
        TreeNode *left=BST(head,start,mid-1);
        TreeNode *th=new TreeNode(head->val);
        th->left=left;
        head=head->next;
        th->right=BST(head,mid+1,end);
        return th;
    }
    TreeNode *sortedListToBST(ListNode *head) {
        if(!head)return NULL;
        ListNode *p=head;
        int count=0;
        while(p){count++;p=p->next;}
        return BST(head,0,count-1);
    }
};

分治法，自顶向下

时间复杂度O(n^2)，空间复杂度O(logn)

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
/**
 * 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 *sortedListToBST(ListNode *head) {
        return sortedListToBST(head,listLength(head));
    }
    TreeNode *sortedListToBST(ListNode *head,int len){
        if(len==0)return NULL;
        if(len==1)return new TreeNode(head->val);
        
        TreeNode *root=new TreeNode(nth_node(head,len/2+1)->val);
        root->left=sortedListToBST(head,len/2);
        root->right=sortedListToBST(nth_node(head,len/2+2),(len-1)/2);
        
        return root;
    }
private:
    int listLength(ListNode *node){
        int n=0;
        while(node){++n;node=node->next;}
        return n;
    }
    ListNode *nth_node(ListNode *node,int n){
        while(--n)node=node->next;
        return node;
    }
};