给定两个二叉树的节点node1 , node2 找到他们的最低公共祖先节点
public Node f(Node head , Node node1 , Node node2){
HashMap<Node , Node> hashMap = new HashMap();
hashMap.put(head , head);
pross(head , hashMap);
HashSet<Node> set1
给定两个二叉树的节点node1 , node2 找到他们的最低公共祖先节点
public Node f(Node head , Node node1 , Node node2){
HashMap<Node , Node> hashMap = new HashMap();
hashMap.put(head , head);
pross(head , hashMap);
HashSet<Node> set1