Why is my code for this BST algorithm question wrong? I am using same logic as the correct solution with one minor tweak and its causing an error

Question

Question is to make the minimum height BST given a sorted array of integers. Logic is pretty much to set node to middle value and recursively do so for left and right subarrays.