LeetCode 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.
  For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

Given the sorted linked list: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5

• 思路
  需要生成平衡二叉树，根据题目的意思，和容易想到左子树的元素个数跟右子树的元素个数相等时，即达到平衡，为了达到平衡，给定集合的中间元素即为根节点，中间元素前面的元素为左子数，中间元素后面的元素为右子树，而左子树和右子树的生成可以递归调用自己。由于给定的集合是链表，无法直接找到中间的元素，因此可以使用一个集合保存所有的链表元素，定位其中间元素。代码见下。
• 代码（c#）

   public TreeNode SortedListToBST(ListNode head) {
        if (head == null) return null;
            List<ListNode> list = new List<ListNode>();
            while (head != null)
            {
                list.Add(head);//集合保存所有的元素
                head = head.next;
            }
            var mid = list.Count / 2;//找到中间的元素
            TreeNode node = new TreeNode(list[mid].val);
            if (mid > 0)
            {
                list[mid - 1].next = null;//将左子树的元素单独出来
            }
            else
            {
                return node;
            }
            node.left = SortedListToBST(list[0]);//递归生成左子树
            if (mid + 1 < list.Count)
            {
                node.right = SortedListToBST(list[mid + 1]);//递归生成右子数
            }
            return node;
    }

• 相关链接
  LeetCode 原题：https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/description/