package com.test;
public class BinarySearchTree<E extends Comparable<? super E>> {
public boolean isEmpty(TreeNode<E> node) {
if (node == null)
return true;
return false;
}
public boolean contains(TreeNode<E> node, TreeNode<E> ele) {
if (node == null)
return false;
if (node.data.compareTo(ele.data) > 0)
contains(node.rightChild, ele);
else if (node.data.compareTo(ele.data) < 0)
contains(node.leftChild, ele);
else
return true;
return false;
}
public TreeNode findMin(TreeNode x){
if(x.leftChild!=null)
findMin(x.leftChild);
else
return x;
return null;
}
public boolean compare(E e) {
return false;
}
private static class TreeNode<E> {
public TreeNode(E element, TreeNode<E> lf, TreeNode<E> rg) {
this.data = element;
this.leftChild = lf;
this.rightChild = rg;
}
private E data;
private TreeNode<E> leftChild;
private TreeNode<E> rightChild;
}
}