Balanced BST Checker

Write a function that checks if a binary search tree (BST) is balanced. A balanced tree is defined as a tree where the height of the left and right subtrees of any node differ by at most one. Your function should return True if the tree is balanced and False otherwise. Input format: The input consists of an integer n, the number of nodes in the tree. The following n lines each contain an integer representing the value of a node in level order (breadth-first). A value of -1 indicates that a node does not exist. Output format: Print "True" if the BST is balanced, otherwise print "False". Example: Input: 5 3 1 4 -1 -1 -1 -1 Output: True