anupsavvy

public class Hashtable{
	private static final int SIZE = 97;
	private Pair[] map = null;

	public Hashtable(){
		this(SIZE);
	}

	public Hashtable(int N){
		map = new Pair[N];

anupsavvy

package com.operations.queue;

public class Queue{

	private int N ;
	private static final int SIZE = 1024;
	private int[] arr = null;
	private int t = 0;
	private int f = 0;

anupsavvy

package com.operations.stack;

public class Stack{

	private static final int SIZE = 1024;

	private int N;

	private int t = -1;

anupsavvy

package com.example.tree;
import com.example.Node;
// Tree is balanced when the difference between maximum and minimum height is <= 1.
public class Tree{

	public static void main(String args[]){
		Node root = new Node();
		if(checkTreeBalance(root))
			System.out.println("Its a balanced tree");
		else

anupsavvy

package com.example.triangle;
import java.io.File;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;
public class Triangle {

	public static void main(String args[]){