Your question is Compute Binary Tree Height. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
Given the root of a binary tree, return its height. Height is the number of nodes on the longest path from the root to any leaf, and an empty tree has height 0.
0 <= number of nodes <= 10^4-10^9 <= Node.val <= 10^9