struct TreeNode* sortedListToBST(struct ListNode* head) {
if(head == NULL)
return NULL;
if(head->next == NULL){
struct TreeNode *root = calloc(1, sizeof(struct TreeNode));
root->val = head->val;
return root;
}
struct ListNode *fast, *slow, *prev;
struct ListNode *dummy = calloc(1, sizeof(struct ListNode));
dummy->next = head;
prev = dummy;
slow = fast = head;
while(fast->next){
fast = fast->next;
if(fast->next)
fast = fast->next;
slow = slow->next;
prev = prev->next;
}
//
//slow is mid pointer
struct TreeNode *root = calloc(1, sizeof(struct TreeNode));
root->val = slow->val;
root->right = sortedListToBST(slow->next);
prev->next = NULL;
root->left = sortedListToBST(dummy->next);
free(dummy);
return root;
}109 Convert Sorted List to Binary Search Tree
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门，熙熙楼的掌柜王于贵愁眉苦脸地迎上来，“玉大人，你说我怎么就摊上这事。” “怎么了？”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着，像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上，一...
- 文/苍兰香墨 我猛地睁开眼，长吁一口气：“原来是场噩梦啊……” “哼！你这毒妇竟也来了？” 一声冷哼从身侧响起，我...
推荐阅读更多精彩内容
- Given a singly linked list where elements are sorted in a...
- Des: Given a singly linked list where elements are sorted...
- Given a singly linked list where elements are sorted in a...
