All About Programming

变种LCA 求一棵树的最深叶子节点的公共父节点   难点2. 多叉树，而不是二叉树。   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78                 this.node = node;                 this.maxDepth = maxDepth;                 return helper(root).node;                                            Result tmp = helper(root.children.get(i));                         else if(tmp.maxDepth == maxDepth){                 TreeNode n1 = new TreeNode(1);                 TreeNode n2 = new TreeNode(2);.                 TreeNode n3 = new TreeNode(3);                 TreeNode n4 = new TreeNode(4);                 TreeNode n5 = new TreeNode(5);                 TreeNode n6 = new TreeNode(6);                 TreeNode n7 = new TreeNode(7);                 TreeNode n8 = new TreeNode(8);                 TreeNode n9 = new TreeNode(9);

Read full article from