1介绍
包含二分搜索树的插入,删除,遍历,等几乎全部功能 ,如果想知道什么是二分搜索树,请查看我的上一篇博客,废话少说,上代码
2 实现–完整版
import java.util.LinkedList;
/**
* 二分搜索树
*
* @author xld
*
* @param <Key>
* @param <Value>
*/
public class BST<Key extends Comparable<Key>, Value> {
/**
* 树中的节点 设置为内部类
*
* @author xld
*
*/
private class Node {
private Key key;
private Value value;
private Node left, right;
public Node(Key key, Value value) {
this.key = key;
this.value = value;
left = right = null;
}
public Node(Node node){
this.key=node.key;
this.value=node.value;
this.left=node.left;
this.right=this.right;
}
}
private Node root;
private int count;
public BST() {
root = null;
count = 0;
}
public int size() {
return count;
}
public boolean isEmpty() {
return count == 0;
}
public void insert(Key key, Value value) {
root = insert(root, key, value);
}
public boolean contain(Key key, Value value) {
return contain(root, key);
}
public Value search(Key key) {
return search(root, key);
}
public void preOrder() {
preOrder(root);
}
public void inOrder() {
inOrder(root);
}
public void postOrder() {
postOrder(root);
}
public void levelOrder() {
LinkedList<Node> q = new LinkedList<Node>();
q.add(root);
while (!q.isEmpty()) {
Node node = q.remove();
System.out.println(node.key);
if (node.left != null)
q.add(node.left);
if (node.right != null)
q.add(node.right);
}
}
public Key minimum() {
assert count != 0;
Node minNode = minimum(root);
return minNode.key;
}
public Key maximum(){
assert count!=0;
Node maxNode = maximum(root);
return maxNode.key;
}
public void removeMin(){
if(root !=null)
root= removeMin(root);
}
public void removeMax(){
if(root !=null)
root = removeMax(root);
}
public void remove(Key key){
root = remove(root,key);
}
/**
* 寻找key的floor值,递归算法
* 如果不存在key的floor值(key比BST的最小值还小) 返回null
* @param key
* @return
*/
public Key floor(Key key){
if(count==0 || key.compareTo(minimum())<0)
return null;
Node floorNode = floor(root,key);
return floorNode.key;
}
public Key ceil(Key key){
if(count==0 || key.compareTo(maximum())>0)
return null;
Node ceilNode =ceil(root,key);
return ceilNode.key;
}
/**
* 向以node为根的二分搜索树中,插入节点(key,value),使用递归算法 返回插入节点后的二分搜索树的根
*
* @param node
* @param key
* @param value
* @return
*/
private Node insert(Node node, Key key, Value value) {
if (node == null) {
count++;
return new Node(key, value);
}
if (key.compareTo(node.key) == 0)
node.value = value;
else if (key.compareTo(node.key) < 0)
node.left = insert(node.left, key, value);
else
node.right = insert(node.right, key, value);
return node;
}
/**
* 查看以node为根的二分搜索树中是否包含键值为key的节点,使用递归算法 若value不存在 则返回false
*
* @param node
* @param key
* @return
*/
private boolean contain(Node node, Key key) {
if (node == null)
return false;
if (key.compareTo(node.key) == 0)
return true;
else if (key.compareTo(node.key) < 0)
return contain(node.left, key);
else
return contain(node.right, key);
}
/**
* 查看以node为根的二分搜索树中键值为key的节点的value值,使用递归算法
*
* @param node
* @param key
* @return
*/
private Value search(Node node, Key key) {
if (node == null)
return null;
if (key.compareTo(node.key) == 0)
return node.value;
else if (key.compareTo(node.key) < 0)
return search(node.left, key);
else
return search(node.right, key);
}
/**
* 二分搜索树的前序遍历
*
* @param node
*/
private void preOrder(Node node) {
if (node != null) {
System.out.println(node.key);
preOrder(node.left);
preOrder(node.right);
}
}
/**
* 二分搜索树的中序遍历
*
* @param node
*/
private void inOrder(Node node) {
if (node != null) {
inOrder(node.left);
System.out.println(node.key);
inOrder(node.right);
}
}
/**
* 二分搜索树的后序遍历
*
* @param node
*/
private void postOrder(Node node) {
if (node != null) {
postOrder(node.left);
postOrder(node.right);
System.out.println(node.key);
}
}
/**
* 二分搜索树中最小的节点就是最左侧的节点
* @param node
* @return
*/
private Node minimum(Node node){
if(node.left==null)
return node;
return minimum(node.left);
}
private Node maximum(Node node){
if(node.right==null)
return node;
return maximum(node.right);
}
/**
* 删除以node为根的二分搜索树的最小值
* @param node
* @return
*/
private Node removeMin(Node node){
if(node.left==null){
Node rightNode =node.right;
node.right=null;
count--;
return rightNode;
}
node.left=removeMin(node.left);
return node;
}
private Node removeMax(Node node){
if(node.right==null){
Node leftNode = node.left;
node.left=null;
count--;
return leftNode;
}
node.right=removeMax(node.right);
return node;
}
/**
* 删除掉以node为根的二分搜索树中键值为key的节点,递归算法
* 返回删除节点后新的二分搜索树的根
* @param node
* @param key
* @return
*/
private Node remove(Node node ,Key key){
if(node ==null)
return null;
if(key.compareTo(node.key)<0){
node.left=remove(node.left,key);
return node;
}else if(key.compareTo(node.key)>0){
node.right=remove(node.right,key);
return node;
}else {
if(node.left==null){
Node rightNode = node.right;
node.right=null;
count--;
return rightNode;
}
if(node.right==null){
Node leftNode = node.left;
node.left=null;
count--;
return leftNode;
}
Node successor = new Node (minimum(node.right));
count++;
successor.right= removeMin(node.right);
successor.left=node.left;
node.left = node.right=null;
count--;
return successor;
}
}
/**
* 在以node为根的二叉搜索树中,寻找key的floor值所处的节点,递归算法
* @param node
* @param key
* @return
*/
private Node floor(Node node,Key key){
if(node == null)
return null;
if(node.key.compareTo(key)==0)
return node;
if(node.key.compareTo(key)>0)
return floor(node.left,key);
Node tempNode = floor(node.right,key);
if(tempNode!=null)
return tempNode;
return node;
}
private Node ceil(Node node,Key key){
if(node == null)
return null;
if(node.key.compareTo(key)==0)
return node;
if(node.key.compareTo(key)<0)
return ceil(node.right,key);
Node tempNode =ceil(node.left,key);
if(tempNode!=null)
return tempNode;
return node;
}
}