LeetCode做題總結：二叉樹

public class Solution15 { public int maxDepth(TreeNode root) { if(root==null) return 0; else return 1+Math.max(maxDepth(root.left),maxDepth(root.right)); } public static void main(String

>>阅读原文<<