Leetcode Problem 109. Convert Sorted List to Binary Search Tree

109. Convert Sorted List to Binary Search Tree

Leetcode Solutions

Calculate the length of the linked list.
Use a recursive helper function convertListToBST which takes parameters start and end to represent the start and end of the list that needs to be converted to a BST.
If start > end, return None as we have no elements to form a subtree.
Calculate the middle index as (start + end) // 2.
Recursively build the left subtree using the range start to mid - 1.
The current list node will be the root node, so create a TreeNode with the current list node's value.
Move the list head to the next element.
Recursively build the right subtree using the range mid + 1 to end.
Return the root node.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen