- Similar to finding maximum depth, the minimum depth of the current node is the smaller of the min height of the left subtree and the right subtree plus one. t1 := &common.TreeNode{Left: nil, Value: ...

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. In the given ...