Challenge: Find the Height of Binary Search Tree

Statement

Given the root of a binary search tree, return the height of the tree. The height of the tree is the length of the longest path from the root node to any leaf node in the tree.

Note: The height of an empty tree is 0, whereas the height of a tree with a single node is 1.

Constraints:

• $-10^{4} \leq$Node.data $\leq 10^{4}$

• The tree contains nodes in the range $[1, 500]$.

Examples