二叉树二叉树的递归Lowest Common Ancestor of a Binary Tree III本页总览Lowest Common Ancestor of a Binary Tree III描述TODO分析TODO代码class Solution { public Node lowestCommonAncestor(Node p, Node q) { Node a = p, b = q; while (a != b) { a = a == null? q : a.parent; b = b == null? p : b.parent; } return a; }}相关题目Lowest Common Ancestor of a Binary TreeLowest Common Ancestor of a Binary Tree IILCA of BST