Remove complexity from comments

Fixes #29

Author: Tyriar

src/binary-heap.js

@@ -1,17 +1,3 @@
-// Explanation: http://www.growingwiththeweb.com/2013/01/data-structure-binary-heap.html
-//
-// Complexity (n=input size):
-//   buildHeap:      Θ(n)
-//   clear:          Θ(1)
-//   decreaseKey:    Θ(log n)
-//   delete:         Θ(log n)
-//   extractMinimum: Θ(log n)
-//   findMinimum:    Θ(1)
-//   insert:         Θ(log n)
-//   isEmpty:        Θ(1)
-//   size:           Θ(1)
-//   union:          Θ(n)
-
 (function (root, factory) {
   'use strict';
   if (typeof define === 'function' && define.amd) {

src/binary-search-tree.js

@@ -1,15 +1,3 @@
-// Explanation: http://www.growingwiththeweb.com/2012/10/data-structures-binary-search-tree.html
-//
-// Complexity (n=input size):
-//  add:         O(n), O(log n) average
-//  contains:    O(n), O(log n) average
-//  findMaximum: O(n), O(log n) average
-//  findMinimum: O(n), O(log n) average
-//  isEmpty:     Θ(1)
-//  remove:      O(n), O(log n) average
-//  traverse*:   Θ(n)
-//  size:        Θ(1)
-
 (function (root, factory) {
   'use strict';
   if (typeof define === 'function' && define.amd) {

src/binomial-heap.js

@@ -1,14 +1,3 @@
-// Explanation: http://www.growingwiththeweb.com/2014/01/binomial-heap.html
-//
-// Complexity (n=input size):
-//   clear:          Θ(1)
-//   extractMinimum: Θ(log n)
-//   findMinimum:    O(log n) amortised
-//   insert:         O(log n)
-//   isEmpty:        Θ(1)
-//   size:           Θ(1)
-//   union:          Θ(log n)
-
 (function (root, factory) {
   'use strict';
   if (typeof define === 'function' && define.amd) {

src/fibonacci-heap.js

@@ -1,16 +1,3 @@
-// Explanation: http://www.growingwiththeweb.com/2014/01/binomial-heap.html
-//
-// Complexity (n=input size):
-//   clear:          Θ(1) amortised
-//   decreaseKey:    Θ(1) amortised
-//   delete:         O(log n) amortised
-//   extractMinimum: O(log n) amortised
-//   findMinimum:    Θ(1)
-//   insert:         Θ(1)
-//   isEmpty:        Θ(1)
-//   size:           Θ(n)
-//   union:          Θ(1)
-
 (function (root, factory) {
   'use strict';
   if (typeof define === 'function' && define.amd) {

src/splay-tree.js

@@ -1,15 +1,3 @@
-// Explanation: http://www.growingwiththeweb.com/2013/06/data-structure-splay-tree.html
-//
-// Complexity (n=input size):
-//  add:         O(log n) amortised
-//  contains:    O(log n) amortised
-//  findMaximum: O(n), O(log n) average
-//  findMinimum: O(n), O(log n) average
-//  isEmpty:     Θ(1)
-//  remove:      O(log n) amortised
-//  traverse*:   Θ(n)
-//  size:        Θ(1)
-
 (function (root, factory) {
   'use strict';
   if (typeof define === 'function' && define.amd) {