Javadoc clean-up

Author: phishman3579

src/com/jwetherell/algorithms/data_structures/AVLTree.java

@@ -12,9 +12,9 @@
  * trees are more rigidly balanced, they are faster than red-black trees for
  * lookup intensive applications. However, red-black trees are faster for
  * insertion and removal.
- * 
- * http://en.wikipedia.org/wiki/AVL_tree
- * 
+ * <p>
+ * @see <a href="https://en.wikipedia.org/wiki/AVL_tree">AVL Tree (Wikipedia)</a>
+ * <br>
  * @author Justin Wetherell <phishman3579@gmail.com>
  */
 public class AVLTree<T extends Comparable<T>> extends BinarySearchTree<T> {

src/com/jwetherell/algorithms/data_structures/BTree.java

@@ -14,9 +14,9 @@
  * two children. Unlike self-balancing binary search trees, the B-tree is
  * optimized for systems that read and write large blocks of data. It is
  * commonly used in databases and file-systems.
- * 
- * http://en.wikipedia.org/wiki/B-tree
- * 
+ * <p>
+ * @see <a href="https://en.wikipedia.org/wiki/B-tree">B-Tree (Wikipedia)</a>
+ * <br>
  * @author Justin Wetherell <phishman3579@gmail.com>
  */
 @SuppressWarnings("unchecked")