BST Traversal

in-order

/**
 * Finds the in-order traversal of the BST
 * 
 * @return A list of the data set in the BST in in-order
 */
public List<T> inOrder() {
	List<T> list = new ArrayList<T>();
	inOrder(root, list);
	return list;
}

public void inOrder(Node<T> node, List<T> list){
	if(node != null){
		inOrder(node.left, list);
		list.add(node.getData());
		inOrder(node.right, list);	
	}
}

post-order

/**
 * Finds the post-order traversal of the BST
 * 
 * @return A list of the data set in the BST in post-order
 */
public List<T> postOrder() {
	List<T> list = new ArrayList<T>();
	postOrder(root, list);
	return list;
}
public void postOrder(Node<T> node, List<T> list){
	if(node != null){
		postOrder(node.left, list);
		postOrder(node.right, list);
		list.add(node.getData());
	}
}

pre-order

/**
 * Finds the pre-order traversal of the BST
 * 
 * @return A list of the data set in the BST in pre-order
 */
public List<T> preOrder() {
	List<T> list = new ArrayList<T>();
	preOrder(root, list);
	return  list;	
}
public void preOrder(Node<T> node, List<T> list) {
	if(node != null){	
		list.add(node.getData());
		preOrder(node.left,list);
		preOrder(node.right,list);
	}	
}