Given the root of a binary tree, return its height (the maximum depth, defined as the number of nodes along the longest path from the root node down to the farthest leaf node). If the tree is empty…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.