首页 > 代码库 > [LeetCode] Convert Sorted List to Binary Search Tree（分治）
[LeetCode] 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.
方法：为了使BST高度平衡，要找链表中的中值作为当前根节点。
/** * 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) { if(head==NULL) return NULL; ListNode *pmid = FindMid(head); TreeNode *root = new TreeNode(pmid->val); if(pmid != head) root->left = sortedListToBST(head); root->right = sortedListToBST(pmid->next); return root; }private: ListNode *FindMid(ListNode *head){//找中间结点 if(head->next==NULL) return head; ListNode *Pmid=head,*p=head,*Pmin_pre = head; while(p!=NULL && p->next != NULL) { p = p->next; p = p->next; Pmin_pre = Pmid; Pmid = Pmid->next; }//end while; Pmin_pre->next = NULL; return Pmid; }};
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。