implement search in AVL tree

DataStructures/Lists/DoublyLinkedList.java

@@ -160,6 +160,19 @@ else if (current == null)
             current.previous = newLink; // 1 <--> newLink <--> 2(current) <--> 3
         }
     }
+
+    public static void removeDuplicates(DoublyLinkedList l ) {
+    	Link linkOne = l.head ;
+    	while(linkOne.next != null) { // list is present  
+    		Link linkTwo = linkOne.next; // second link for comparison
+    		while(linkTwo.next!= null) {
+    			if(linkOne.value == linkTwo.value) // if there are duplicates values then 
+    				l.delete(linkTwo.value);  // delete the link
+    			linkTwo = linkTwo.next ; // go to next link 
+    		}
+    		linkOne = linkOne.next; // go to link link to iterate the whole list again
+    	}
+    }
 
     /**
      * Returns true if list is empty

DataStructures/Trees/AVLTree.java

@@ -202,6 +202,29 @@ private void reheight(Node node) {
         }
     }
 
+        public boolean search(int key) {
+    	Node result = searchHelper(this.root,key);
+    	if(result != null)
+    		return true ;
+
+    	return false ;
+    }
+
+    private Node searchHelper(Node root, int key) 
+    { 
+        //root is null or key is present at root 
+        if (root==null || root.key==key) 
+            return root; 
+
+        // key is greater than root's key 
+        if (root.key > key) 
+            return searchHelper(root.left, key); // call the function on the node's left child
+
+        // key is less than root's key then 
+        //call the function on the node's right child as it is greater
+        return searchHelper(root.right, key); 
+    } 
+
     public static void main(String[] args) {
         AVLTree tree = new AVLTree();