Added DFS and BFS to the BST

git-svn-id: https://java-algorithms-implementation.googlecode.com/svn/trunk@372 032fbc0f-8cab-eb90-e552-f08422b9a96a

Author: phishman3579

src/com/jwetherell/algorithms/data_structures/BinarySearchTree.java

@@ -1,9 +1,10 @@
 package com.jwetherell.algorithms.data_structures;
 
+import java.util.ArrayDeque;
 import java.util.ArrayList;
 import java.util.List;
 import java.util.Random;
-
+import java.util.Queue;
 
 /**
  * A binary search tree (BST), which may sometimes also be called an ordered or
@@ -450,13 +451,33 @@ protected boolean validateNode(Node<T> node) {
     }
 
     /**
-     * Get an array representation of the tree in sorted order.
+     * Get an array representation of the tree in breath first search order.
      * 
-     * @return sorted array representing the tree.
+     * @return breath first search sorted array representing the tree.
      */
     @SuppressWarnings("unchecked")
-    public T[] getSorted() {
-        // Depth first search to traverse the tree in order.
+    public T[] getBFS() {
+        Queue<Node<T>> queue = new ArrayDeque<Node<T>>();
+        T[] values = (T[]) new Comparable[size];
+        int count = 0;
+        Node<T> node = root;
+        while (node!=null) {
+            values[count++] = node.id;
+            if (node.lesser!=null) queue.add(node.lesser);
+            if (node.greater!=null) queue.add(node.greater);
+            if (!queue.isEmpty()) node = queue.remove();
+            else node = null;
+        }
+        return values;
+    }
+
+    /**
+     * Get an array representation of the tree in depth first search order.
+     * 
+     * @return depth first search sorted array representing the tree.
+     */
+    @SuppressWarnings("unchecked")
+    public T[] getDFS() {
         List<Node<T>> added = new ArrayList<Node<T>>(2);
         T[] nodes = (T[]) new Comparable[size];
         int index = 0;
@@ -490,6 +511,16 @@ public T[] getSorted() {
         }
         return nodes;
     }
+    
+    /**
+     * Get an array representation of the tree in sorted order.
+     * 
+     * @return sorted array representing the tree.
+     */
+    public T[] getSorted() {
+        // Depth first search to traverse the tree in order.
+        return getDFS();
+    }
 
     /**
      * {@inheritDoc}