Merge pull request #1238 from santiago1617/master

Updates

Contributors.html

@@ -472,7 +472,8 @@
       <a class="box-item" href="https://github.com/rocksaini"><span>Deepak Saini</span></a>
       <a class="box-item" href="https://github.com/Vikrant804"><span>Vikrant Kamble</span></a>
       <a class="box-item" href="https://github.com/asquaree"><span>Aakash Aggarwal</span></a>
-     <a class="box-item" href="https://github.com/shweta-tripathe"><span>shweta tripathi</span></a>
+      <a class="box-item" href="https://github.com/shweta-tripathe"><span>shweta tripathi</span></a>
+      <a class="box-item" href="https://github.com/santiago1617"><span>Santiago Tumbaco</span></a>
 
 
 

Program's_Contributed_By_Contributors/Java_Programs/Data_structure/BinaryNode.java

@@ -0,0 +1,46 @@
+
+public class BinaryNode<T> {
+
+    private T content;
+    private BinaryTree<T> left;
+    private BinaryTree<T> right;
+
+    public BinaryNode() {
+        this(null, null, null);
+    }
+
+    public BinaryNode(T content) {
+        this(content, null, null);
+    }
+
+    public BinaryNode(T content, BinaryTree<T> left, BinaryTree<T> right) {
+        this.content = content;
+        this.left = left;
+        this.right = right;
+    }
+
+    public T getContent() {
+        return content;
+    }
+
+    public void setContent(T content) {
+        this.content = content;
+    }
+
+    public BinaryTree<T> getLeft() {
+        return left;
+    }
+
+    public void setLeft(BinaryTree<T> left) {
+        this.left = left;
+    }
+
+    public BinaryTree<T> getRight() {
+        return right;
+    }
+
+    public void setRight(BinaryTree<T> right) {
+        this.right = right;
+    }
+
+}