Tag: Maximum Depth of Binary Tree

Problem Statement 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. Example: Input: root = [3,9,20,null,null,15,7] Output: 3 问题 给定一个二叉树的根节点，返回其最大深度。 二叉树的最大深度是从根节点到最远叶节点的最长路径上的节点数量。 示例： 输入: root…