TestAll.java

package com.m0226.test;

import org.junit.Test;

import com.m0226.basic.ArrayList;
import com.m0226.basic.BinaryTree;
import com.m0226.basic.Iterator;
import com.m0226.basic.LinkedList;
import com.m0226.basic.Queue;
import com.m0226.basic.Stack;

public class TestAll {
	@Test
	public void testArrayList(){
		ArrayList list1=new ArrayList();
		list1.add(0);
		list1.add(1);
		//list1.add(3, -1);//error
		//list1.remove(2);//error
		Iterator ite=list1.iterator();
		while(ite.hasNext()){
			System.out.println(ite.next());
		}
	}
	@Test
	public void testLinkedList(){
		LinkedList list2=new LinkedList();
		list2.add(0);
		list2.add(1);
		list2.addFirst(-1);
		list2.addLast(-2);
		
		list2.removeFirst();
		list2.removeLast();
		list2.remove(0);
		
		Iterator ite2=list2.iterator();
		while(ite2.hasNext()){
			System.out.println(ite2.next());
		}
	}
	@Test
	public void testStack(){
		Stack stack=new Stack();
		stack.push(0);
		stack.push(1);
		stack.push(2);
		System.out.println(stack.peek());
		System.out.println(stack.pop());
		System.out.println(stack.peek());
	}
	@Test
	public void testQueue(){
		Queue queue=new Queue();
		queue.enQueue(0);
		queue.enQueue(1);
		
		System.out.println(queue.deQueue());
	}
	@Test
	public void testBinaryTree(){
		BinaryTree<Integer> tree=new BinaryTree<>();
		tree.insert(3);
		tree.insert(2);
		tree.insert(5);
		//tree.insert(5);//error,duplicate
		tree.insert(1);
		tree.traversal(tree.getRoot());
	}
	
}