model1220的学习之路

class Node{ public int data; public Node left; public Node right; public int leftmaxdistance; public int rightmaxdistance; public Node(int data) { this.data=data; this.left=null; this.righ

如何求二叉树的最大深度呢？ 利用的方法是深度搜索，终止条件是左右孩子为空。 static int getmax(treenode node) { if(node==null) { return 0; }else { int lef=getmax(node.left); int rig=getmax(node.right); return Math.max

问题描述： 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. 这里要求根节点到最近的叶子节点的距离，

class TreeNode{ private Object data; public Object getData() { return data; } public void setData(Object data) { this.data = data; } TreeNode left=null; TreeNode right=null; } public class