Balance of subtree

Question

Balance of subtree Given the root of a binary search tree and the value of a node, write a function to find and return the balance factor of the subtree at that node. Return 0 if the node with the given value does not exist. Example 1 > - **Input:** root = [4, 2, 6, 1, null, null, 7], value = 2 > - **Output:** 1 > - **Explanation:** > - height of left subtree = 1 > - height of right subtree = 0 > - balance factor = 1 - 0 = 1 Example 2 > - **Input:** root = [2, 1, 4, null, null, 3, 7], value = 4 > - **Output:** 0 > - **Explanation:** > - height of left subtree = 1 > - height of right subtree = 1 > - balance factor = 1 - 1 = 0

Accepted Answer

Optimal Solution: Time Complexity O(N), Space Complexity O(1). Codeintuition provides an interactive coding environment for this problem.