Given the root of a binary tree, return its maximum depth.
A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
0 <= number of nodes <= 10^4-100 <= Node.val <= 100root = [3,9,20,null,null,15,7]3root = [1,null,2]2