Method makeBSTByInorder

Tree/ConvertSortedListToBinarySearchTree.py:128–139

(size)

            head = head.next
        
        def makeBSTByInorder(size):
            if not size:
                return 
            
            root = TreeNode(None)
            
            root.left = makeBSTByInorder(size//2)
            root.val = self.c_head.val
            self.c_head = self.c_head.next
            root.right = makeBSTByInorder(size-size//2-1)
            
            return root
        
        return makeBSTByInorder(size)