flexelem

import java.util.NoSuchElementException;

/**
 * CLRS - Introduction to Algorithms Ex.10.1-2
 * Explain how to implement two stacks in one array A[1..n] in such a way that 
 * neither stack overflows unless the total number of elements in both stacks together is n. 
 * The PUSH and POP operations should run in O(1) time.
 * 
 * There are two stacks in one array which the first one grows upwards ( A[1..N] ), 
 * and the second one grows downwards ( A[N..1] ).

flexelem

import java.util.NoSuchElementException;
import java.util.Stack;

/**
 * CLRS - Introduction to Algorithms Ex.10.1-6
 * 
 * Show how to implement a queue using two stacks. Analyze the running time of the queue operations
 * 
 * */
public class QueueWithTwoStack {

flexelem

import java.util.LinkedList;
import java.util.NoSuchElementException;
import java.util.Queue;

/**
 * Show how to implement a stack using two queues. Analyze the running time of the queue operations.
 * 
*/
public class StackWithTwoQueue {

flexelem

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;

/**
 * This class will compute the number of connected components of an un-directed graph. If graph is fully connected than it will return 1.
 * 
 * @author buraktas
 *
 */

flexelem

package graph.search.dfs;

import static org.junit.Assert.assertEquals;
import graph.entity.Vertex;

import java.util.ArrayList;
import java.util.Arrays;

import org.junit.Before;
import org.junit.Test;

flexelem

package compute_strongly_connected_components;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Stack;

public class ComputeSCC {

flexelem

public class BinarySearchTree {

    private Node root;

    public BinarySearchTree() {

        this.root = null;
    }

    public BinarySearchTree(Node root) {

flexelem

import java.util.ArrayList;

public class MinHeap {

    private ArrayList<Integer> list;

    public MinHeap() {

        this.list = new ArrayList<Integer>();
    }

flexelem

import java.util.Stack;

public class FindNextGreatestGivenArray {

    // works in O(n*n)
    public int[] findNextGreatestNumbers(int[] numbers) {

        if (numbers == null) {
            throw new IllegalArgumentException("Given array is null");
        }

flexelem

public class LinkedList {

    public class Node {

        int  data;
        Node next;

        public Node(int item) {

            this.data = item;