422 lines
11 KiB
Java
422 lines
11 KiB
Java
|
/*This is a Java Program to implement Self Balancing Binary Search Tree. A self-balancing (or height-balanced) binary search tree is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions.
|
||
|
|
These structures provide efficient implementations for mutable ordered lists, and can be used for other abstract data structures such as associative arrays, priority queues and sets. The implementation of self balancing binary search tree is similar to that of a AVL Tree data structure.*/
|
||
|
|
|
||
|
|
/*
|
||
|
|
* Java Program to Implement Self Balancing Binary Search Tree
|
||
|
|
*/
|
||
|
|
|
||
|
|
import java.util.Scanner;
|
||
|
|
|
||
|
|
/* Class SBBSTNode */
|
||
|
|
class SBBSTNode
|
||
|
|
{
|
||
|
|
SBBSTNode left, right;
|
||
|
|
int data;
|
||
|
|
int height;
|
||
|
|
|
||
|
|
/* Constructor */
|
||
|
|
public SBBSTNode()
|
||
|
|
{
|
||
|
|
left = null;
|
||
|
|
right = null;
|
||
|
|
data = 0;
|
||
|
|
height = 0;
|
||
|
|
}
|
||
|
|
/* Constructor */
|
||
|
|
public SBBSTNode(int n)
|
||
|
|
{
|
||
|
|
left = null;
|
||
|
|
right = null;
|
||
|
|
data = n;
|
||
|
|
height = 0;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Class SelfBalancingBinarySearchTree */
|
||
|
|
class SelfBalancingBinarySearchTree
|
||
|
|
{
|
||
|
|
private SBBSTNode root;
|
||
|
|
|
||
|
|
/* Constructor */
|
||
|
|
public SelfBalancingBinarySearchTree()
|
||
|
|
{
|
||
|
|
root = null;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Function to check if tree is empty */
|
||
|
|
public boolean isEmpty()
|
||
|
|
{
|
||
|
|
return root == null;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Make the tree logically empty */
|
||
|
|
public void clear()
|
||
|
|
{
|
||
|
|
root = null;
|
||
|
|
}
|
||
|
|
/* Function to insert data */
|
||
|
|
public void insert(int data)
|
||
|
|
{
|
||
|
|
root = insert(data, root);
|
||
|
|
}
|
||
|
|
/* Function to get height of node */
|
||
|
|
private int height(SBBSTNode t )
|
||
|
|
{
|
||
|
|
return t == null ? -1 : t.height;
|
||
|
|
}
|
||
|
|
/* Function to max of left/right node */
|
||
|
|
private int max(int lhs, int rhs)
|
||
|
|
{
|
||
|
|
return lhs > rhs ? lhs : rhs;
|
||
|
|
}
|
||
|
|
/* Function to insert data recursively */
|
||
|
|
private SBBSTNode insert(int x, SBBSTNode t)
|
||
|
|
{
|
||
|
|
if (t == null)
|
||
|
|
t = new SBBSTNode(x);
|
||
|
|
else if (x < t.data)
|
||
|
|
{
|
||
|
|
t.left = insert( x, t.left );
|
||
|
|
if (height( t.left ) - height( t.right ) == 2)
|
||
|
|
if (x < t.left.data)
|
||
|
|
t = rotateWithLeftChild( t );
|
||
|
|
else
|
||
|
|
t = doubleWithLeftChild( t );
|
||
|
|
}
|
||
|
|
else if (x > t.data)
|
||
|
|
{
|
||
|
|
t.right = insert( x, t.right );
|
||
|
|
if (height( t.right ) - height( t.left ) == 2)
|
||
|
|
if (x > t.right.data)
|
||
|
|
t = rotateWithRightChild( t );
|
||
|
|
else
|
||
|
|
t = doubleWithRightChild( t );
|
||
|
|
}
|
||
|
|
else
|
||
|
|
; // Duplicate; do nothing
|
||
|
|
t.height = max( height( t.left ), height( t.right ) ) + 1;
|
||
|
|
return t;
|
||
|
|
}
|
||
|
|
/* Rotate binary tree node with left child */
|
||
|
|
private SBBSTNode rotateWithLeftChild(SBBSTNode k2)
|
||
|
|
{
|
||
|
|
SBBSTNode k1 = k2.left;
|
||
|
|
k2.left = k1.right;
|
||
|
|
k1.right = k2;
|
||
|
|
k2.height = max( height( k2.left ), height( k2.right ) ) + 1;
|
||
|
|
k1.height = max( height( k1.left ), k2.height ) + 1;
|
||
|
|
return k1;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Rotate binary tree node with right child */
|
||
|
|
private SBBSTNode rotateWithRightChild(SBBSTNode k1)
|
||
|
|
{
|
||
|
|
SBBSTNode k2 = k1.right;
|
||
|
|
k1.right = k2.left;
|
||
|
|
k2.left = k1;
|
||
|
|
k1.height = max( height( k1.left ), height( k1.right ) ) + 1;
|
||
|
|
k2.height = max( height( k2.right ), k1.height ) + 1;
|
||
|
|
return k2;
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* Double rotate binary tree node: first left child
|
||
|
|
* with its right child; then node k3 with new left child */
|
||
|
|
private SBBSTNode doubleWithLeftChild(SBBSTNode k3)
|
||
|
|
{
|
||
|
|
k3.left = rotateWithRightChild( k3.left );
|
||
|
|
return rotateWithLeftChild( k3 );
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* Double rotate binary tree node: first right child
|
||
|
|
* with its left child; then node k1 with new right child */
|
||
|
|
private SBBSTNode doubleWithRightChild(SBBSTNode k1)
|
||
|
|
{
|
||
|
|
k1.right = rotateWithLeftChild( k1.right );
|
||
|
|
return rotateWithRightChild( k1 );
|
||
|
|
}
|
||
|
|
/* Functions to count number of nodes */
|
||
|
|
public int countNodes()
|
||
|
|
{
|
||
|
|
return countNodes(root);
|
||
|
|
}
|
||
|
|
private int countNodes(SBBSTNode r)
|
||
|
|
{
|
||
|
|
if (r == null)
|
||
|
|
return 0;
|
||
|
|
else
|
||
|
|
{
|
||
|
|
int l = 1;
|
||
|
|
l += countNodes(r.left);
|
||
|
|
l += countNodes(r.right);
|
||
|
|
return l;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
/* Functions to search for an element */
|
||
|
|
public boolean search(int val)
|
||
|
|
{
|
||
|
|
return search(root, val);
|
||
|
|
}
|
||
|
|
private boolean search(SBBSTNode r, int val)
|
||
|
|
{
|
||
|
|
boolean found = false;
|
||
|
|
while ((r != null) && !found)
|
||
|
|
{
|
||
|
|
int rval = r.data;
|
||
|
|
if (val < rval)
|
||
|
|
r = r.left;
|
||
|
|
else if (val > rval)
|
||
|
|
r = r.right;
|
||
|
|
else
|
||
|
|
{
|
||
|
|
found = true;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
found = search(r, val);
|
||
|
|
}
|
||
|
|
return found;
|
||
|
|
}
|
||
|
|
/* Function for inorder traversal */
|
||
|
|
public void inorder()
|
||
|
|
{
|
||
|
|
inorder(root);
|
||
|
|
}
|
||
|
|
private void inorder(SBBSTNode r)
|
||
|
|
{
|
||
|
|
if (r != null)
|
||
|
|
{
|
||
|
|
inorder(r.left);
|
||
|
|
System.out.print(r.data +" ");
|
||
|
|
inorder(r.right);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
/* Function for preorder traversal */
|
||
|
|
public void preorder()
|
||
|
|
{
|
||
|
|
preorder(root);
|
||
|
|
}
|
||
|
|
private void preorder(SBBSTNode r)
|
||
|
|
{
|
||
|
|
if (r != null)
|
||
|
|
{
|
||
|
|
System.out.print(r.data +" ");
|
||
|
|
preorder(r.left);
|
||
|
|
preorder(r.right);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
/* Function for postorder traversal */
|
||
|
|
public void postorder()
|
||
|
|
{
|
||
|
|
postorder(root);
|
||
|
|
}
|
||
|
|
private void postorder(SBBSTNode r)
|
||
|
|
{
|
||
|
|
if (r != null)
|
||
|
|
{
|
||
|
|
postorder(r.left);
|
||
|
|
postorder(r.right);
|
||
|
|
System.out.print(r.data +" ");
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Class SelfBalancingBinarySearchTreeTest */
|
||
|
|
public class SelfBalancingBinarySearchTreeTest
|
||
|
|
{
|
||
|
|
public static void main(String[] args)
|
||
|
|
{
|
||
|
|
Scanner scan = new Scanner(System.in);
|
||
|
|
/* Creating object of SelfBalancingBinarySearchTree */
|
||
|
|
SelfBalancingBinarySearchTree sbbst = new SelfBalancingBinarySearchTree();
|
||
|
|
System.out.println("SelfBalancingBinarySearchTree Test\n");
|
||
|
|
char ch;
|
||
|
|
/* Perform tree operations */
|
||
|
|
do
|
||
|
|
{
|
||
|
|
System.out.println("\nSelfBalancingBinarySearchTree Operations\n");
|
||
|
|
System.out.println("1. insert ");
|
||
|
|
System.out.println("2. search");
|
||
|
|
System.out.println("3. count nodes");
|
||
|
|
System.out.println("4. check empty");
|
||
|
|
System.out.println("5. clear tree");
|
||
|
|
int choice = scan.nextInt();
|
||
|
|
switch (choice)
|
||
|
|
{
|
||
|
|
case 1 :
|
||
|
|
System.out.println("Enter integer element to insert");
|
||
|
|
sbbst.insert( scan.nextInt() );
|
||
|
|
break;
|
||
|
|
case 2 :
|
||
|
|
System.out.println("Enter integer element to search");
|
||
|
|
System.out.println("Search result : "+ sbbst.search( scan.nextInt() ));
|
||
|
|
break;
|
||
|
|
case 3 :
|
||
|
|
System.out.println("Nodes = "+ sbbst.countNodes());
|
||
|
|
break;
|
||
|
|
case 4 :
|
||
|
|
System.out.println("Empty status = "+ sbbst.isEmpty());
|
||
|
|
break;
|
||
|
|
case 5 :
|
||
|
|
System.out.println("\nTree Cleared");
|
||
|
|
sbbst.clear();
|
||
|
|
break;
|
||
|
|
default :
|
||
|
|
System.out.println("Wrong Entry \n ");
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
/* Display tree */
|
||
|
|
System.out.print("\nPost order : ");
|
||
|
|
sbbst.postorder();
|
||
|
|
System.out.print("\nPre order : ");
|
||
|
|
sbbst.preorder();
|
||
|
|
System.out.print("\nIn order : ");
|
||
|
|
sbbst.inorder();
|
||
|
|
System.out.println("\nDo you want to continue (Type y or n) \n");
|
||
|
|
ch = scan.next().charAt(0);
|
||
|
|
}
|
||
|
|
while (ch == 'Y'|| ch == 'y');
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
SelfBalancingBinarySearchTree Operations
|
||
|
|
|
||
|
|
1. insert
|
||
|
|
2. search
|
||
|
|
3. count nodes
|
||
|
|
4. check empty
|
||
|
|
5. clear tree
|
||
|
|
1
|
||
|
|
Enter integer element to insert
|
||
|
|
5
|
||
|
|
|
||
|
|
Post order : 5
|
||
|
|
Pre order : 5
|
||
|
|
In order : 5
|
||
|
|
Do you want to continue (Type y or n)
|
||
|
|
|
||
|
|
y
|
||
|
|
|
||
|
|
SelfBalancingBinarySearchTree Operations
|
||
|
|
|
||
|
|
1. insert
|
||
|
|
2. search
|
||
|
|
3. count nodes
|
||
|
|
4. check empty
|
||
|
|
5. clear tree
|
||
|
|
1
|
||
|
|
Enter integer element to insert
|
||
|
|
8
|
||
|
|
|
||
|
|
Post order : 8 5
|
||
|
|
Pre order : 5 8
|
||
|
|
In order : 5 8
|
||
|
|
Do you want to continue (Type y or n)
|
||
|
|
|
||
|
|
y
|
||
|
|
|
||
|
|
SelfBalancingBinarySearchTree Operations
|
||
|
|
|
||
|
|
1. insert
|
||
|
|
2. search
|
||
|
|
3. count nodes
|
||
|
|
4. check empty
|
||
|
|
5. clear tree
|
||
|
|
1
|
||
|
|
Enter integer element to insert
|
||
|
|
24
|
||
|
|
|
||
|
|
Post order : 5 24 8
|
||
|
|
Pre order : 8 5 24
|
||
|
|
In order : 5 8 24
|
||
|
|
Do you want to continue (Type y or n)
|
||
|
|
|
||
|
|
y
|
||
|
|
|
||
|
|
SelfBalancingBinarySearchTree Operations
|
||
|
|
|
||
|
|
1. insert
|
||
|
|
2. search
|
||
|
|
3. count nodes
|
||
|
|
4. check empty
|
||
|
|
5. clear tree
|
||
|
|
1
|
||
|
|
Enter integer element to insert
|
||
|
|
6
|
||
|
|
|
||
|
|
Post order : 6 5 24 8
|
||
|
|
Pre order : 8 5 6 24
|
||
|
|
In order : 5 6 8 24
|
||
|
|
Do you want to continue (Type y or n)
|
||
|
|
|
||
|
|
y
|
||
|
|
|
||
|
|
SelfBalancingBinarySearchTree Operations
|
||
|
|
|
||
|
|
1. insert
|
||
|
|
2. search
|
||
|
|
3. count nodes
|
||
|
|
4. check empty
|
||
|
|
5. clear tree
|
||
|
|
3
|
||
|
|
Nodes = 4
|
||
|
|
|
||
|
|
Post order : 6 5 24 8
|
||
|
|
Pre order : 8 5 6 24
|
||
|
|
In order : 5 6 8 24
|
||
|
|
Do you want to continue (Type y or n)
|
||
|
|
|
||
|
|
y
|
||
|
|
|
||
|
|
SelfBalancingBinarySearchTree Operations
|
||
|
|
|
||
|
|
1. insert
|
||
|
|
2. search
|
||
|
|
3. count nodes
|
||
|
|
4. check empty
|
||
|
|
5. clear tree
|
||
|
|
2
|
||
|
|
Enter integer element to search
|
||
|
|
8
|
||
|
|
Search result : true
|
||
|
|
|
||
|
|
Post order : 6 5 24 8
|
||
|
|
Pre order : 8 5 6 24
|
||
|
|
In order : 5 6 8 24
|
||
|
|
Do you want to continue (Type y or n)
|
||
|
|
|
||
|
|
y
|
||
|
|
|
||
|
|
SelfBalancingBinarySearchTree Operations
|
||
|
|
|
||
|
|
1. insert
|
||
|
|
2. search
|
||
|
|
3. count nodes
|
||
|
|
4. check empty
|
||
|
|
5. clear tree
|
||
|
|
5
|
||
|
|
|
||
|
|
Tree Cleared
|
||
|
|
|
||
|
|
Post order :
|
||
|
|
Pre order :
|
||
|
|
In order :
|
||
|
|
Do you want to continue (Type y or n)
|
||
|
|
|
||
|
|
y
|
||
|
|
|
||
|
|
SelfBalancingBinarySearchTree Operations
|
||
|
|
|
||
|
|
1. insert
|
||
|
|
2. search
|
||
|
|
3. count nodes
|
||
|
|
4. check empty
|
||
|
|
5. clear tree
|
||
|
|
4
|
||
|
|
Empty status = true
|
||
|
|
|
||
|
|
Post order :
|
||
|
|
Pre order :
|
||
|
|
In order :
|
||
|
|
Do you want to continue (Type y or n)
|
||
|
|
|
||
|
|
n
|