首页 > 代码库 > Convert Sorted List to Balanced Binary Search Tree (BST)
Convert Sorted List to Balanced Binary Search Tree (BST)
(http://leetcode.com/2010/11/convert-sorted-list-to-balanced-binary.html)
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
Code:
BinaryTree* sortedListToBST(ListNode *& list, int start, int end){ if (start > end) return NULL; int mid = start + (end - start) / 2; BinaryTree* leftChild = sortedListToBST(list, start, mid-1); BinaryTree* parent = new BinaryTree(list->data); parent->left = leftChild; list = list->next; parent->right = sortedListToBST(list, mid+1, end); return parent;}BinaryTree* sortedListToBST(ListNode* head, int n){ return sortedListToBST(head, 0, n-1);}
Convert Sorted List to Balanced Binary Search Tree (BST)
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。