{{ message }}

Instantly share code, notes, and snippets.

# Burak Aktas flexelem

Created May 4, 2014
Queue implementation with using two stacks
View QueueWithTwoStack.java
 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 {
Created May 4, 2014
Implement a stack using two queues
View StackWithTwoQueue.java
 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 {
Created May 11, 2014
Compute the number of connected components of an undirected graph
View CountConnectedComponents.java
 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 * */
Created May 18, 2014
Non-Recursive DFS implementation by using a Stack
View DFSNonRecursiveTest.java
 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;
Last active Aug 29, 2015
Binary Search Tree implementation
View BinarySearchTree.java
 public class BinarySearchTree { private Node root; public BinarySearchTree() { this.root = null; } public BinarySearchTree(Node root) {
Last active Aug 29, 2015
Given an array of number find the next greater no in the right of each element.
View FindNextGreatestGivenArray.java
 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"); }
Created Jun 13, 2014
Reverse a linked list by given K size slots with recursion