jmpokar

package tree;

/*				
			50
			/\
		40		60
		/\		/\
	  30  45   55 70
			   /\
			  52 58

jmpokar

package tree;
import java.util.LinkedList;
import java.util.Queue;



public class PrintNodesOfLastLevelOfBinaryTree {
	private Node rootNode;

	public static void main(String[] args) {

jmpokar

package tree;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;

/*				

			50
			/\
		     40     60

jmpokar

package tree;
/*				
			50
			/\
		    40	    60
		    /\	    /\
	     	  30  45   55 70
	  	  /\
     		20 35	
*/

jmpokar

package tree;

/*				
			    50
			    /\
			40	60
			/\	/\
		      30  45   55 70
		      /\
	             20 35

jmpokar

package miscellaneous;

public class TrieDictionary {

	private TrieNode rootNode = new TrieNode('\0', false);

	public static void main(String[] args) {
		new TrieDictionary();
	}
	public TrieDictionary() {

jmpokar

package miscellaneous;

import java.util.LinkedHashMap;
import java.util.Map;


public class IntegerToRomanNumber {
	
	public static void main(String[] args) {
		new IntegerToRomanNumber();

jmpokar

package sorting;

public class QuickSort {
	public static void main(String[] args) {
		new QuickSort();
	}

	public QuickSort() {
		int[] arr=new int[]{6,1,4,2,3};

jmpokar

package sorting;

public class MergeSort {

	public static void main(String[] args) {	
		new MergeSort();
	}

	public MergeSort() {
		int[] arr=new int[]{6,1,4,2,3,5,10,2,2,1,6};

jmpokar

package sorting;

public class SelectionSort {
	public static void main(String[] args) {
		new SelectionSort();
	}
	
	public SelectionSort() {
		int[] arr=new int[]{1,4,3,2,1};