Leetcode109.Convert_Sorted_List_To_Binary_Search_Tree

在Leetcode看别人的代码，有用快慢指针寻找中点，在二分递归的。但个人觉得既然无论如何都是O(N)的时间复杂度了，不如将链表转换成数组解决方便。思路同Leetcode108.Convert_Sorted_Array_To_Binary_Search_Tree
时间复杂度:O(N)
C++代码：

class Solution {
public:
	TreeNode * sortedListToBST(ListNode* head) {
		vector<int> nums;
		while (head != nullptr)
		{
			nums.push_back(head->val);
			head = head->next;
		}
		return sortedArrayToBST(nums);
	}
	TreeNode* sortedArrayToBST(vector<int>& nums) {
		if (nums.empty())
			return nullptr;
		int mid = nums.size() >> 1;
		TreeNode* root = new TreeNode(nums[mid]);
		arrayToBST(nums, 0, mid - 1, root, 0);
		arrayToBST(nums, mid + 1, nums.size() - 1, root, 1);
		return root;
	}
	void arrayToBST(vector<int>& num, int st, int en, TreeNode* root, int dir)
	{
		if (st > en)
			return;
		int mid = (st + en) >> 1;
		TreeNode* temp = new TreeNode(num[mid]);
		if (dir)
			root->right = temp;
		else
			root->left = temp;
		if (st != en)
		{
			if (dir)
			{
				arrayToBST(num, st, mid - 1, root->right, 0);
				arrayToBST(num, mid + 1, en, root->right, 1);
			}
			else
			{

				arrayToBST(num, st, mid - 1, root->left, 0);
				arrayToBST(num, mid + 1, en, root->left, 1);
			}
		}
	}
};