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