Skip to main content

Java Program To Implement Red Black Tree Operations.

import java.util.Scanner;
public class RedBlackTreeA {
public static void main(String[] args) {

Scanner scan = new Scanner(System.in);
RBTree rbt = new RBTree(Integer.MIN_VALUE);
char ch;

do {       // Deletion of Nodes is not implemented.
System.out.println("Red Black Tree Operations:");
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\n");
System.out.print("Enter Your Choice: ");

int choice = scan.nextInt();
switch (choice) {

case 1 :
System.out.print("Enter An Integer To Insert: ");
rbt.insert( scan.nextInt() );
break;

case 2 :
System.out.print("Enter An Integer To Search: ");
System.out.println("Search Result : "+ rbt.search( scan.nextInt() ));
break;

case 3 :
System.out.println("Nodes = "+ rbt.countNodes());
break;

case 4 :
System.out.println("Empty Status = "+ rbt.isEmpty());
break;

case 5 :
System.out.println("Tree Cleared");
rbt.makeEmpty();
break;

default :
System.out.print("Wrong Entry \n ");
break;
}

System.out.print("\nPost Order : ");
rbt.postorder();
System.out.print("\nPre Order : ");
rbt.preorder();
System.out.print("\nIn Order : ");
rbt.inorder();

System.out.println("\n\nDo You Want To Continue (Type Y OR N): ");
ch = scan.next().charAt(0);
} while (ch == 'Y'|| ch == 'y');

scan.close();
}}

RedBlackNode.java:
class RedBlackNode {
RedBlackNode left, right;
int element;
int color;

public RedBlackNode(int theElement){
this( theElement, null, null );
}

public RedBlackNode(int theElement, RedBlackNode lt, RedBlackNode rt){
left = lt;
right = rt;
element = theElement;
color = 1;
}}

class RBTree {
private RedBlackNode current;
private RedBlackNode parent;
private RedBlackNode grand;
private RedBlackNode great;
private RedBlackNode header;
private static RedBlackNode nullNode;

static {
nullNode = new RedBlackNode(0);
nullNode.left = nullNode;
nullNode.right = nullNode;
}

static final int BLACK = 1;
static final int RED   = 0;

public RBTree(int negInf) {
header = new RedBlackNode(negInf);
header.left = nullNode;
header.right = nullNode;
}

public boolean isEmpty() {
return header.right == nullNode;
}

public void makeEmpty() {
header.right = nullNode;
}

public void insert(int item ) {
current = parent = grand = header;
nullNode.element = item;

while (current.element != item) {
great = grand;
grand = parent;
parent = current;

current = item < current.element ? current.left : current.right;
if (current.left.color == RED && current.right.color == RED)
handleReorient( item );
}

if (current != nullNode)
return;
current = new RedBlackNode(item, nullNode, nullNode);

if (item < parent.element)
parent.left = current;

else
parent.right = current;
handleReorient( item );
}

private void handleReorient(int item) {
current.color = RED;
current.left.color = BLACK;
current.right.color = BLACK;

if (parent.color == RED) {
grand.color = RED;

if (item < grand.element != item < parent.element)
parent = rotate( item, grand );  // Start dbl rotate
current = rotate(item, great );
current.color = BLACK;
}

header.right.color = BLACK;
}

private RedBlackNode rotate(int item, RedBlackNode parent){

if(item < parent.element)
return parent.left = item < parent.left.element ? rotateWithLeftChild(parent.left) : rotateWithRightChild(parent.left) ; 

else
return parent.right = item < parent.right.element ? rotateWithLeftChild(parent.right) : rotateWithRightChild(parent.right); 
}

private RedBlackNode rotateWithLeftChild(RedBlackNode k2){
RedBlackNode k1 = k2.left;
k2.left = k1.right;
k1.right = k2;
return k1;
}

private RedBlackNode rotateWithRightChild(RedBlackNode k1){
RedBlackNode k2 = k1.right;
k1.right = k2.left;
k2.left = k1;
return k2;
}

public int countNodes() {
return countNodes(header.right);
}

private int countNodes(RedBlackNode r) {
if (r == nullNode)
return 0;

else {
int l = 1;
l += countNodes(r.left);
l += countNodes(r.right);
return l;
}}

public boolean search(int val) {
return search(header.right, val);
}

private boolean search(RedBlackNode r, int val) {
boolean found = false;

while ((r != nullNode) && !found) {
int rval = r.element;

if (val < rval)
r = r.left;

else if (val > rval)
r = r.right;

else {
found = true;
break;
}

found = search(r, val);
}
return found;
}

public void inorder() {
inorder(header.right);
}

private void inorder(RedBlackNode r) {

if (r != nullNode) {
inorder(r.left);
char c = 'B';

if (r.color == 0)
c = 'R';

System.out.print(r.element +""+c+" ");
inorder(r.right);
}}

public void preorder() {
preorder(header.right);
}

private void preorder(RedBlackNode r) {
if (r != nullNode) {
char c = 'B';

if (r.color == 0)
c = 'R';

System.out.print(r.element +""+c+" ");
preorder(r.left);
preorder(r.right);
}}

public void postorder(){
postorder(header.right);
}

private void postorder(RedBlackNode r) {

if (r != nullNode) {
postorder(r.left);
postorder(r.right);
char c = 'B';

if (r.color == 0)
c = 'R';

System.out.print(r.element +""+c+" ");
}}}
Labels:

Popular posts from this blog

Screenshots from Windows 1.01

Windows 1.0 is a graphical personal computer operating environment developed by Microsoft, released on November 20, 1985, as the first version of the Microsoft Windows line. Version 1.01 , also released in 1985, was the first point-release after Windows 1.00.   Screenshots from Windows 1.01: ⇰ Desktop  First Run Empty Desktop Desktop With Applications ⇰  Office Applications Notepad Text Editor Calculator Calendar Clock Address Book ⇰  Multimedia Applications Media player, CD player, Volume level, and Sound: This GUI doesn’t have these features. ⇰  Networking Applications Terminal Phone Dialer: This GUI doesn’t have this feature. ⇰  Internet Applications Browser, and Mail: This GUI doesn’t have these features. ⇰  Accessibility Applications Keyboard Map:  This GUI doesn’t have this feature. ⇰  Settings Desktop themes,  Display,  S...
Read more

C Program To Check Whether A Number Is Palindrome Or Not.

This program takes an integer from user and the integer is reversed. If the reversed integer is equal to the integer entered by user then that number is a palindrome. If not that number is not a palindrome.   #include <stdio.h> int main()  { int num, temp, remainder, reverse = 0; printf("Enter an integer: "); scanf("%d", &num); /*  original number is stored at temp */ temp = num; while (num > 0)  { remainder = num % 10; reverse = reverse * 10 + remainder; num /= 10;   }
Read more

C++ Program To Implement Casino Number Guessing Game.

#include <iostream> #include <string> #include <cstdlib> #include <ctime> using namespace std; void drawLine(int n, char symbol); void rules(); int main() { string playerName; int amount; int bettingAmount; int guess; int dice; char choice; srand(time(0)); drawLine(70,'_'); cout << "\n\n\n\t\tCASINO GAME\n\n\n\n"; drawLine(70,'_'); cout << "\n\nEnter Your Name : "; getline(cin, playerName); cout << "\n\nEnter Deposit Amount To Play Game : $"; cin >> amount;
Read more

C Program To Convert Natural Numbers To Roman Numerals.

Roman Number System of representing numbers devised by the ancient Romans. The numbers are formed by combinations of the symbols I, V, X, L, C, D, and M, standing, respectively, for 1, 5, 10, 50, 100, 500, and 1,000 in the Hindu-Arabic numeral system. Natural numbers mean no negative numbers and no fractions, i.e. the whole numbers from 1 upwards: 1, 2, 3, and so on. Here is source code of the C program to convert natural numbers to Roman Numerals. It compiles and runs on any operating system. #include <stdio.h> void predigit(char num1, char num2); void postdigit(char c, int n); char romanval[1000]; int i = 0; int main() { int j; long number; printf("Enter any natural number: "); scanf("%d", &number);
Read more