leetcode: Convert Sorted List to Binary Search Tree

利用排序的链表和二叉搜索树的性质

中序遍历二叉搜索树结果就是排序

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
/**
 * Definition for binary tree
 * 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( head == NULL)
            return NULL;
        int n = getLength(head);
        return _toBST( head, 1, n);
    }
    int getLength( ListNode *head){
        int n = 0;
        while( head){
            head = head->next;
            ++n;
        }
        return n;
    }
    TreeNode *_toBST( ListNode *&head, int left, int right){//这里必须传指针的引用
        if( left > right)
            return NULL;
        int mid = left + ( ( right - left) >> 1);
        TreeNode *leftchild = _toBST( head, left, mid - 1);
        TreeNode *parent = new TreeNode( head->val);
        head = head->next;//这里head一改变，全局的head都改变了，所以程序才能正确运行，所以传参必须是指针的引用
        parent->left = leftchild;
        TreeNode *rightchild = _toBST( head, mid + 1, right);
        parent->right = rightchild;
        return parent;
    }
};