【LeetCode】 109. Convert Sorted List to Binary Search Tree C语言

最新推荐文章于 2020-10-20 20:00:04 发布

Long915319744

最新推荐文章于 2020-10-20 20:00:04 发布

阅读量323

点赞数

分类专栏：数据结构-链表文章标签： leetcode 数据结构链表指针 C语言

本文链接：https://blog.csdn.net/godlovelong/article/details/70209423

版权

数据结构-链表专栏收录该内容

25 篇文章 0 订阅

订阅专栏

LeetCode解题心得，欢迎交流！第三日

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
 
struct TreeNode *toBST(struct ListNode *head,struct ListNode *tail) 
{
    
    if(head==tail) return NULL;
    struct ListNode *fast=head;
    struct ListNode *slow=head;
    
    while(fast!=tail && fast->next!=tail) // 这样写是错的while(fast!=NULL && fast->next!=NULL)
    {
        fast=fast->next->next;
        slow=slow->next;
    }
    
    struct TreeNode *tree_head=(struct TreeNode *)malloc(sizeof(struct TreeNode));
    tree_head->val = slow->val;
    tree_head->left = toBST(head,slow);
    tree_head->right=toBST(slow->next,tail);
    
    return tree_head;
}

struct TreeNode* sortedListToBST(struct ListNode* head) {
    if(head == NULL) return NULL;
    return toBST(head,NULL);
    
}