首页 > 代码库 > 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.
/** * 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) {} * }; */ struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} }; struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) :val(x), left(NULL), right(NULL) {} }; class Solution { public: TreeNode *sortedListToBST(ListNode *head) { int n = 0; ListNode *p = head; while(p != NULL) { p = p->next; n++; } return ListToBST(head,0,n-1); } private: TreeNode *ListToBST(ListNode *&head,int start, int end) { if(start > end) return NULL; int mid = (start + end) / 2; TreeNode *left = ListToBST(head,start,mid - 1); TreeNode *node = new TreeNode(head->val); node->left = left; head = head->next; node->right = ListToBST(head,mid + 1,end); return node; } };
leetcode - Convert Sorted List to Binary Search Tree
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。