Updated second constructor of BTreeNode.

Author: Olcay Taner YILDIZ

src/main/java/DataStructure/Tree/BTree.java

@@ -40,7 +40,7 @@ public void insert(T data){
             s = root.insertLeaf(data, comparator);
             if (s != null){
                 BTreeNode<T> tmp = root;
-                root = new BTreeNode<>(tmp, s, tmp.K[d], d);
+                root = new BTreeNode<>(d, tmp, s, tmp.K[d]);
                 tmp.K[d] = null;
             }
         } else {

src/main/java/DataStructure/Tree/BTreeNode.java

@@ -17,7 +17,7 @@ public BTreeNode(int d){
         K = (T[]) new Object[2 * d + 1];
         children = new BTreeNode[2 * d + 1];
     }
-    public BTreeNode(BTreeNode<T> firstChild, BTreeNode<T> secondChild, T newK, int d){
+    public BTreeNode(int d, BTreeNode<T> firstChild, BTreeNode<T> secondChild, T newK){
         this(d);
         leaf = false;
         m = 1;
@@ -93,7 +93,7 @@ public BTreeNode<T> insertNode(T value, Comparator<T> comparator, boolean isRoot
             newNode.children[d] = s;
             m = d;
             if (isRoot){
-                BTreeNode<T> a = new BTreeNode<T>(this, newNode, this.K[d], d);
+                BTreeNode<T> a = new BTreeNode<T>(d, this, newNode, this.K[d]);
                 this.K[d] = null;
                 return a;
             } else {