二叉查找树的插入，删除，查找

二叉查找树的添加，删除，查找算法：

import java.util.Scanner;public class BinarySearchTree> {BiNode root;class BiNode{AnyType data;BiNode left;BiNode right;public BiNode(AnyType data){this.data=data;}public BiNode(AnyType data,BiNode left,BiNode right){this.data=data;this.left=left;this.right=right;}}//添加public void insert(AnyType x){root=insert(x,root);}public BiNode insert(AnyType x,BiNode t){if(t==null)return new BiNode(x,null,null);int compareResult=x.compareTo((AnyType)t.data); if(compareResult>0)t.right=insert(x,t.right);if(compareResult<0)t.left=insert(x,t.left);else;return t;}//查找public boolean contains(AnyType x){return contains(x,root);}public boolean contains(AnyType x,BiNode t){if(t==null)return false;int compareResult=x.compareTo((AnyType)t.data);if(compareResult>0)return contains(x,t.right);if(compareResult<0)return contains(x,t.left);else return true;}//找最大和最小public AnyType findMin(){return (AnyType) findMin(root).data;}public BiNode findMin(BiNode t){if(t==null)return null;else if(t.left==null)return t;elsereturn findMin(t.left);}public AnyType findMax(){		   	return (AnyType) findMax(root).data;}public BiNode findMax(BiNode t){if(t==null)return null;else if(t.left==null)return t;elsereturn findMax(t.left);}//删除public void remove(AnyType x){root=remove(x,root); }public BiNode remove(AnyType x,BiNode t){if(t==null)return t;int compareResult=x.compareTo((AnyType)t.data);if(compareResult<0)t.left=remove(x,t.left);else if(compareResult>0)t.right=remove(x,t.right);else if(t.left!=null&&t.right!=null){t.data=findMin(t.right).data;t.right=remove((AnyType)t.data,t.right);}elset=(t.left!=null)?t.left:t.right;return t;	}//中序遍历public void inOrder(){inOrder(root);}public void inOrder(BiNode t){if(t!=null){inOrder(t.left);System.out.print(t.data+"    ");inOrder(t.right);}}public static void main(String[] args) {Scanner sc=new Scanner(System.in);BinarySearchTree bsh=new BinarySearchTree();for(int i=0;i<6;i++){                                 //输入六个数，个数可改变int numble=sc.nextInt();bsh.insert(numble);}bsh.inOrder();}}

版权声明：本文为博主原创文章，未经博主允许不得转载。

转载于:https://www.cnblogs.com/dingxiaoyue/p/4931860.html

本文来自互联网用户投稿，文章观点仅代表作者本人，不代表本站立场，不承担相关法律责任。如若转载，请注明出处。 如若内容造成侵权/违法违规/事实不符，请点击【内容举报】进行投诉反馈！