Update a comment on the B-Tree constructor to describe order

phishman3579 · phishman3579 · commit be54c909497b · 2013-02-23T17:26:37.000Z
git-svn-id: https://java-algorithms-implementation.googlecode.com/svn/trunk@411 032fbc0f-8cab-eb90-e552-f08422b9a96a
diff --git a/src/com/jwetherell/algorithms/data_structures/BTree.java b/src/com/jwetherell/algorithms/data_structures/BTree.java
@@ -35,7 +35,8 @@ public class BTree<T extends Comparable<T>> implements ITree<T> {
     public BTree() { }
 
     /**
-     * Constructor for B-Tree of ordered parameter.
+     * Constructor for B-Tree of ordered parameter. Order here means minimum 
+     * number of keys in a non-root node. 
      * 
      * @param order
      *            of the B-Tree.

Original file line number	Diff line number	Diff line change
`@@ -35,7 +35,8 @@ public class BTree<T extends Comparable<T>> implements ITree<T> {`
`35`	`35`	`public BTree() { }`
`36`	`36`
`37`	`37`	`/**`
`38`		`- * Constructor for B-Tree of ordered parameter.`
	`38`	`+ * Constructor for B-Tree of ordered parameter. Order here means minimum`
	`39`	`+ * number of keys in a non-root node.`
`39`	`40`	`*`
`40`	`41`	`* @param order`
`41`	`42`	`* of the B-Tree.`