/**
* BST树的节点类型
* @param <T>
*/
class BSTNode <T extends Comparable<T>>{
private T data; // 数据域
private BSTNode<T> left; // 左孩子域
private BSTNode<T> right; // 右孩子域
public BSTNode(T data, BSTNode<T> left, BSTNode<T> right) {
this.data = data;
this.left = left;
this.right = right;
}
public T getData() {
return data;
}
public void setData(T data) {
this.data = data;
}
public BSTNode<T> getLeft() {
return left;
}
public void setLeft(BSTNode<T> left) {
this.left = left;
}
public BSTNode<T> getRight() {
return right;
}
public void setRight(BSTNode<T> right) {
this.right = right;
}
}
/**
* BST树的实现
* @param <T>
*/
class BST<T extends Comparable<T>>{
private BSTNode<T> root; // 指向根节点
/**
* BST树的初始化
*/
public BST() {
this.root = null;
}
/**
* 返回两个节点的公共节点
* @param data1
* @param data2
* @return
*/
public T getLCA(T data1, T data2){
return getLCA(this.root, data1, data2);
}
private T getLCA(BSTNode<T> root, T data1, T data2) {
if(root == null){
return null;
}
if(root.getData().compareTo(data1) > 0
&& root.getData().compareTo(data2) > 0){
return getLCA(root.getLeft(), data1, data2);
} else if(root.getData().compareTo(data1) < 0
&& root.getData().compareTo(data2) < 0){
return getLCA(root.getRight(), data1, data2);
} else {
return root.getData();
}
}
}
二叉树返回两个节点的公共节点
最新推荐文章于 2022-07-04 14:17:07 发布