Java Program To Implement Skew Heap

Chapter: Data Structures Last Updated: 13-07-2016 09:25:15 UTC

Program:

            /* ............... START ............... */
                
import java.util.*;

class SkewNode {
	int element;
	SkewNode left, right;

	public SkewNode(int val) {
		this.element = val;
		this.left = null;
		this.right = null;
	}
}

class SkewHeap {
	private SkewNode root;
	private int size;

	public SkewHeap() {
		root = null;
		size = 0;
	}

	public boolean isEmpty() {
		return root == null;
	}

	public void clear() {
		root = null;
		size = 0;
	}

	public int getSize() {
		return size;
	}

	public void insert(int val) {
		root = merge(root, new SkewNode(val));
		size++;
	}

	public void remove() {
		if (root == null)
			throw new NoSuchElementException("Element not found");
		root = merge(root.left, root.right);
		size--;
	}

	private SkewNode merge(SkewNode x, SkewNode y) {
		if (x == null)
			return y;
		if (y == null)
			return x;

		if (x.element < y.element) {
			SkewNode temp = x.left;
			x.left = merge(x.right, y);
			x.right = temp;
			return x;
		} else {
			SkewNode temp = y.right;
			y.right = merge(y.left, x);
			y.left = temp;
			return y;
		}
	}

	public void displayHeap() {
		System.out.print("\nHeap : ");
		displayHeap(root);
		System.out.println("\n");
	}

	private void displayHeap(SkewNode r) {
		if (r != null) {
			displayHeap(r.left);
			System.out.print(r.element + " ");
			displayHeap(r.right);
		}
	}
}

public class JavaSkewHeapExample {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		System.out.println("Skew Heap Test\n\n");

		SkewHeap sh = new SkewHeap();

		char ch;

		do {
			System.out.println("\nSkewHeap Operations\n");
			System.out.println("1. insert ");
			System.out.println("2. delete ");
			System.out.println("3. size");
			System.out.println("4. check empty");
			System.out.println("5. clear");

			int choice = scan.nextInt();
			switch (choice) {
			case 1:
				System.out.println("Enter integer element to insert");
				sh.insert(scan.nextInt());
				break;
			case 2:
				sh.remove();
				break;
			case 3:
				System.out.println("Size = " + sh.getSize());
				break;
			case 4:
				System.out.println("Empty status = " + sh.isEmpty());
				break;
			case 5:
				sh.clear();
				System.out.println("Heap Cleared\n");
				break;
			default:
				System.out.println("Wrong Entry \n ");
				break;
			}

			sh.displayHeap();
			System.out.println("\nDo you want to continue (Type y or n) \n");
			ch = scan.next().charAt(0);
		} while (ch == 'Y' || ch == 'y');
	}
}
                /* ............... END ............... */
        

Output

Skew Heap Test



SkewHeap Operations

1. insert 
2. delete 
3. size
4. check empty
5. clear
1
Enter integer element to insert
1

Heap : 1 


Do you want to continue (Type y or n) 

y

SkewHeap Operations

1. insert 
2. delete 
3. size
4. check empty
5. clear
3
Size = 1

Heap : 1 


Do you want to continue (Type y or n) 

y

SkewHeap Operations

1. insert 
2. delete 
3. size
4. check empty
5. clear
3
Size = 1

Heap : 1 


Do you want to continue (Type y or n) 

Notes:

  • A skew heap (or self-adjusting heap) is a heap data structure implemented as a binary tree.
  • Skew heaps are advantageous because of their ability to merge more quickly than binary heaps.

Tags

Implement Skew Heap, Java, Data Structures

Similar Programs Chapter Last Updated
HashMap Implementation In Java Data Structures 07-07-2018
Linked List Implementation In Java Data Structures 09-03-2018
Queue Implementation In Java Data Structures 22-09-2018
Stack Implementation In Java Data Structures 22-09-2018
Binary Search Tree Java Data Structures 11-02-2018
Insertion Sort In Java Data Structures 10-02-2018
Java Stack Example Data Structures 16-10-2017
Java String Array Sort Data Structures 31-03-2017
Java Hashmap Add Key And Value Data Structures 25-03-2017
Java Binary Tree Vertical Sum Data Structures 11-11-2016
Java Binary Tree Boundary Traversal Data Structures 11-11-2016
Java Binary Tree Lowest Common Ancestor (LCA) Data Structures 11-11-2016
Java Binary Tree Maximum Element Data Structures 11-11-2016
Java Three Dimensional Array Data Structures 28-10-2016
Java Infix Expression To Postfix Expression Data Structures 25-10-2016
Java Linked List Add Element First And Last Data Structures 24-10-2016
Java Maximum Element From Vector Data Structures 24-10-2016
Java Binary Search On Vector Data Structures 24-10-2016
Java Get Elements Of LinkedList Data Structures 23-10-2016
Java Linked List Update Element Data Structures 23-10-2016
Java Delete Elements From LinkedList Data Structures 23-10-2016
Java Double Ended Queue Data Structures 09-10-2016
Java Dynamic Queue Using Array Data Structures 26-09-2018
Java Queue Array Based Implementation Data Structures 07-10-2016
Java Sort Short Array Data Structures 25-09-2016
Java Sort Long Array Data Structures 25-09-2016
Java Sort Int Array Data Structures 19-09-2016
Java Sort Float Array Data Structures 19-09-2016
Java Sort Double Array Data Structures 19-09-2016
Java Sort Char Array Data Structures 19-09-2016

1 2 3