首页 > 代码库 > 109. Convert Sorted List to Binary Search Tree
109. 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
public TreeNode SortedListToBST(ListNode head) { TreeNode tree = null; if(head == null) return tree; if(head.next == null) return new TreeNode(head.val); //find the middle pionter; var walker = head; var runner = head; var prev = new ListNode(-1); while(runner != null && runner.next != null) { prev = walker; walker = walker.next; runner = runner.next.next; } prev.next =null; //root tree = new TreeNode(walker.val); //subtree tree.left = SortedListToBST(head); tree.right = SortedListToBST(walker.next); return tree; }
109. Convert Sorted List to Binary Search Tree
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。