diff --git a/src/main/java/com/dataStructures/BinaryTree.java b/src/main/java/com/dataStructures/BinaryTree.java
new file mode 100644
index 00000000..1a35fed7
--- /dev/null
+++ b/src/main/java/com/dataStructures/BinaryTree.java
@@ -0,0 +1,125 @@
+package dataStructures;
+
+/**
+ * Binary tree for general value type, without redundancy
+ * @author RICARDO
+ * @param <T> root data
+ */
+public class BinaryTree<T extends Comparable> {
+    private final T data;
+    private BinaryTree  right,  // the upper binary tree
+                        left;   // the lower binary tree
+
+    public BinaryTree(T data) {
+        this.data = data;
+    }
+
+    @Override
+    public String toString(){
+        return this.data.toString();
+    }
+    
+    /**
+     * inserts a new value in it's correspondant place
+     * @param newDataValue value of the new banary tree to add on this tree
+     */
+    public void insert(T newDataValue){
+        this.insert(new BinaryTree(newDataValue));
+    }
+    
+    /**
+     * inserts a new binary tree in it's correspondant place
+     * @param newData new value to add on this tree 
+     */
+    public void insert(BinaryTree newData){
+        
+        int cpr = newData.data.compareTo(this.data); //new value comparission respect to actual value
+        
+        if (cpr < 0)
+            if (this.left == null)
+                this.setLeft(newData);
+            else
+                this.left.insert(newData);
+        else if (cpr > 0)
+            if (this.right == null)
+                this.setRight(newData);
+            else
+                this.right.insert(newData);
+        else
+            System.out.println("Redundant value, not added");
+    }
+
+    /**
+     * search and specific value on the tree
+     * @param data Searched value 
+     * @return Binary tree wich contains the value, null if it doesn't exist
+     */
+    public BinaryTree search(T data){
+        int cpr = data.compareTo(this.data); //new value comparission respect to actual value
+        
+        if (cpr < 0) {
+            if (this.left == null)
+                return null;    //the value doesn't exist
+            return this.left.search(data);
+        }
+        if (cpr > 0) {
+            if (this.right == null)
+                return null;    //the value doesn't exist
+            return this.right.search(data);             
+        }
+        return this;
+    }
+    
+    /**
+     * Checks if the data value exist in the tree
+     * @param data data to be searched
+     * @return true if this tree contains the data value, false if not.
+     */
+    public boolean contains(T data){
+        return !(this.search(data) == null);
+    }
+    
+    /**
+     * uses recursive black magic to print this tree in console
+     * @param tabCounter prev tabs
+     */
+    private void print(int tabCounter){
+        for (int i = 0; i < tabCounter; i++)
+            System.out.print("\t");
+        
+        System.out.println(this);
+        
+        if (this.left!=null)
+            this.left.print(tabCounter+1);  //it can't be ++ , pls don't change it
+        if (this.right!=null)
+            this.right.print(tabCounter+1);  //it can't be ++ , pls don't change it
+    }
+    
+    /**
+     * uses black magic to print this tree in console
+     */
+    public void print(){
+        this.print(0);
+    }
+    
+    //getters and setters
+    public T getData() {
+        return data;
+    }
+
+    public BinaryTree getRight() {
+        return right;
+    }
+
+    public void setRight(BinaryTree right) {
+        this.right = right;
+    }
+
+    public BinaryTree getLeft() {
+        return left;
+    }
+
+    public void setLeft(BinaryTree left) {
+        this.left = left;
+    }
+}
\ No newline at end of file
diff --git a/src/test/java/com/dataStructures/BinaryTreeTest.java b/src/test/java/com/dataStructures/BinaryTreeTest.java
new file mode 100644
index 00000000..cfc03559
--- /dev/null
+++ b/src/test/java/com/dataStructures/BinaryTreeTest.java
@@ -0,0 +1,60 @@
+package dataStructures;
+
+import org.junit.Test;
+import static org.junit.Assert.*;
+
+/**
+ *
+ * @author RICARDO
+ */
+public class BinaryTreeTest {
+    
+    public BinaryTreeTest() {
+    }
+    
+    /**
+     * Test of insert method, of class BinaryTree.
+     */
+    @Test
+    public void testInsert_BinaryTree() {
+        System.out.println("insert");
+        BinaryTree<String> lowerdata = new BinaryTree<>("1");
+        BinaryTree<String> upperdata = new BinaryTree<>("3");
+        BinaryTree<String> instance = new BinaryTree<>("2");
+        instance.insert(lowerdata);
+        instance.insert(upperdata);
+        String proof = instance.getLeft().toString()+instance.toString()+instance.getRight().toString();
+        System.out.println(proof);
+        assertEquals("123", proof);
+    }
+
+    /**
+     * Test of search method, of class BinaryTree.
+     */
+    @Test
+    public void testSearch() {
+        System.out.println("search");
+        BinaryTree<Integer> instance = new BinaryTree<>(5);
+        for (int i = 1; i < 10; i++) {
+            instance.insert(new Integer(i));
+        }
+        BinaryTree result = instance.search(new Integer(1));
+        assertEquals(new Integer(1), result.getData());
+    }
+
+    /**
+     * Test of contains method, of class BinaryTree.
+     */
+    @Test
+    public void testContains() {
+        System.out.println("contains");
+        BinaryTree<Integer> instance = new BinaryTree<>(5);
+        for (int i = 1; i < 10; i++) {
+            instance.insert(i);
+        }
+        
+        boolean result = instance.contains(2)&&instance.contains(11);
+        assertEquals(false, result);
+    }
+
+}