public Node findFatherNode (Node root, int data1, int data2, int data3) {
if (root == null) {
return null;
}
if (root.data == data1 || root.data == data2 || root.data == data3
|| root.left.data == data1 || root.left.data == data2 || root.left.data == data3
|| root.right.data == data1 || root.right.data == data2 || root.right.data == data3) {
return cur;
}
Node leftNode = findFatherNode (root.left, int data1, int data2, int data3);
Node rightNode = findFatherNode (root.right, int data1, int data2, int data3);
if (leftNode != null && rightNode != null) {
return root;
}
if(leftNode != null) {
return leftNode;
}
if(rightNode != null) {
return rightNode;
}
}
二叉树寻找公共父节点
最新推荐文章于 2021-09-23 08:30:21 发布