[leetcode][list][dfs] 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 a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* sortedListToBST(ListNode* head) {
	if (NULL == head) return NULL;
	//找到中间节点(快慢指针)
	ListNode *fast = head;//一次走两步
	ListNode *slow = head;//一次走一步，当快指针到达链表尾部是慢指针到达链表的中间位置
	ListNode *pre = NULL;//slow的前一个节点
	while (fast && fast->next){
		fast = fast->next->next;
		pre = slow;
		slow = slow->next;
	}
	//构建根节点
	TreeNode *root = new TreeNode(slow->val);
	if (NULL == pre) return root;//只有一个节点
	pre->next = NULL;
	//构建左子树
	root->left = sortedListToBST(head);
	//构建右子树
	root->right = sortedListToBST(slow->next);
	//返回根节点
	return root;
}
};