0.二叉树最大深度 原题目:Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. 方法:求最大深度的时候,只需要比较左右子树的深度,取较大者+1就行了 C++代码: class Solution { public: int minDep…