stuyy

public class BinarySearchTree {
	
	public BSTNode root; // Root of the Tree
	public int totalCount;
	
	public boolean isEmpty()
	{
		return root == null;
	}

stuyy

public class BinarySearchTree {
	
	public BSTNode root; // Root of the Tree
	public int totalCount;
	
	public boolean isEmpty()
	{
		return root == null;
	}

stuyy

public class BinarySearchTree {
	
	public BSTNode root; // Root of the Tree
	public int totalCount;
	
	public boolean isEmpty()
	{
		return root == null;
	}

stuyy

public class BinarySearchTree {
	
	public BSTNode root; // Root of the Tree
	public int totalCount;
	
	public boolean isEmpty()
	{
		return root == null;
	}

stuyy

public class BinarySearchTree {
	
	public BSTNode root; // Root of the Tree
	public int totalCount;
	
	public boolean isEmpty()
	{
		return root == null;
	}

stuyy

public class BinarySearchTree {
	
	public BSTNode root; // Root of the Tree
	public int totalCount;
	
	public boolean isEmpty()
	{
		return root == null;
	}

stuyy

public class BinarySearchTree {
	
	public BSTNode root; // Root of the Tree
	public int totalCount;
	
	public boolean isEmpty()
	{
		return root == null;
	}

stuyy

package HW4;

public class Stack {
	
	Node top;
	Node head;

	public Stack()
	{
		

stuyy

public class DoublyLinkedList {
	
	public Node head;
	public Node tail;
	public int size;
	
	public DoublyLinkedList()
	{
		

stuyy

public class DoublyLinkedList {
	
	public Node head;
	public Node tail;
	public int size;
	
	public DoublyLinkedList()
	{