Changes added.

Author: navbhu

src/cs/ds/lists/LinkedList.java

@@ -86,8 +86,28 @@ public static void main(String[] args) {
 
 		for(int i=0; i < nodeList.getLength(); i++) {
 			System.out.println("data in position " + i +"  is : " + nodeList.getData(i));
-		}		
+		}
+
+		Node head = swapNodes(nodeList.getHead());
+
+        while(head !=null){
+            System.out.print(head.getData()+" ");
+            head = head.getNextNode();
+        }
 	}
+
+	private static Node swapNodes(Node head){
+        if(head == null || head.getNextNode() == null) {
+            return head;
+        }
+        Node temp = head;
+        Node second = head.getNextNode();
+        Node newHead = second.getNextNode();
+        head = second;
+        head.setNextNode(temp);
+        temp.setNextNode(swapNodes(newHead));
+        return head;
+    }
 }
 
 

src/cs/ds/trees/BinarySearchTree.java

@@ -219,7 +219,7 @@ private void printRootToLeaf(Node rootNode, String previousValue){
 	public static void main(String[] args) {
 
 		BinarySearchTree binaryTree = new BinarySearchTree();
-		binaryTree.add(7);
+		/*binaryTree.add(7);
 		binaryTree.add(6);
 		binaryTree.add(8);
 		binaryTree.add(3);
@@ -235,7 +235,15 @@ public static void main(String[] args) {
 		binaryTree.add(15);
 		binaryTree.add(1);
 		binaryTree.add(4);
-		
+		*/
+
+		binaryTree.add(5);
+		binaryTree.add(3);
+		binaryTree.add(2);
+		binaryTree.add(4);
+		binaryTree.add(9);
+		binaryTree.add(6);
+		binaryTree.add(11);
 		System.out.println("Size of this node is : "+binaryTree.size());
 		System.out.println("Max depth is : " + binaryTree.maxDepth());
 		System.out.println("Min Value is : " + binaryTree.minValue());
@@ -248,6 +256,27 @@ public static void main(String[] args) {
 		System.out.print(binaryTree.valueExists(0));
 		System.out.println();
 		binaryTree.printRootToLeaf();
+
+		BinarySearchTree bst = new BinarySearchTree();
+		createNew(binaryTree.rootNode, 4,7, bst);
+		System.out.println("new tree data is : ");
+		bst.printData();
 	}
 
+
+	private static BinarySearchTree createNew(Node root, int min, int max, BinarySearchTree bst){
+		if(root!=null) {
+			if (root.data >= min && root.data <= max) {
+				bst.add(root.data);
+			}
+			if (root.data >= min) {
+				createNew(root.getLeftNode(), min, max, bst);
+			}
+
+			if (root.data < max) {
+				createNew(root.getRightNode(), min, max, bst);
+			}
+		}
+			return bst;
+	}
 }