摘要:
二叉树按层遍历 public class WideFirstSearch { public static void main(String[] args) { Node root = new Node("A"); root.left = new Node("B"); root.right = new 阅读全文
摘要:
/** * 深度遍历的一个简单例子 * */ public class EmployeeImportance { private static int res = 0; private static Employee employee; public static void main(String[ 阅读全文