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. Thoughts As with a lot of tree algorithms I think the best solu...
lc.sweezy.io1 min readNo responses yet.