Method to know the size (the number of elements) of our list. O(1)

Let us peek the last element of the list. O(1)

Let us peek the last element of the list. O(1)

Adds the element to the list. O(1)

Pushes an element to the end of the list. O(1)

Unshifts an element. i.e. adds an element to the start of the list. O(1)

Removes the element from the list. O(1)

Pops an element. i.e. returns the last element of the list and gets removed from the list. O(1)

Shifts an element. i.e. returns the first element of the list and gets removed from the list. O(1)

Method to know if our list is empty O(1)

Let us know if the element is contained in the list. O(n)

Returns the first element in the list that returns true in the condition passed through the anonimus function. O(n)

var l = new List();
var item = {
  x:1,
  y:3
}
l.add(item);
console.log(l.findOne(e=>e.y==3));

Returns all the elements in the list that returns true in the condition passed through the anonimus function. O(n)

var l = new List();
var item = {
  x:1,
  y:3
}
l.add(item);
var item2 = {
  x:19,
  y:3
}
l.add(item2);
console.log(l.find(e=>e.y==3));

forEach implementation for list. O(n)

Returns the i element of the list. O(n)

Changes the i element of the list. O(n)

Returns the index of the element searched. O(n)

Returns an array with all the elements. O(n)

Adds the element to the list. O(1)

Pushes an element to the end of the list. O(1)

We don't allow unshifting in SelfOrganizingList, so unshift has the same behaviour as push.

Returns the first element in the list that returns true in the condition passed through the anonimus function. O(n)

var l = new List();
var item = {
  x:1,
  y:3
}
l.add(item);
console.log(l.findOne(e=>e.y==3));

Returns all the elements in the list that returns true in the condition passed through the anonimus function. O(n)

var l = new List();
var item = {
  x:1,
  y:3
}
l.add(item);
var item2 = {
  x:19,
  y:3
}
l.add(item2);
console.log(l.find(e=>e.y==3));

Method to know the size (the number of elements) of our tree. O(1)

Adds an element to the tree, the element can't be null. O(n)

Adds all the elements of an array.

Let us remove the first element in the tree that it's equal to the one in the parameter. O(n)

Let us know if an element is contained inside the tree. O(n)

forEach implementation for tree, it can go through the tree in bfs or dfs but it will do it in dfs inorder if there is no argument, ie the tree will be travel in order from lower to higer. O(n)

Goes through the tree in dfs in preorder. O(n)

Goes through the tree in bfs. O(n)

Method to know if our tree is empty O(1)

Returns an array with the elements in order (lower to higher). O(n)

Removes all elements from the tree. O(1)

Returns a copy which is a different instance from the original tree. O(n^2)

Rotates a tree given a node. Given a node called p and a right son called q, after the operation the node q will become the father of p. If p has no right son this method will result in nothing. O(1)

Rotates a tree given a node. Given a node called q and a left son called p, after the operation the node p will become the father of q. If q has no left son this method will result in nothing. O(1)

Adds an element to the tree, the element can't be null. O(Logn)

Let us remove the first element in the tree that it's equal to the one in the parameter. O(Logn)

Does nothing Rotations are not allowed in AVL trees.

Does nothing Rotations are not allowed in AVL trees.

Adds an couple of key and value. There are no repeated keys, if two elements have the same keys the value will be updated. Since this is a tree the elements will be order using the keys. O(n)

Adds all the elements of an array. O(n^2)

Removes an element from the tree, given the key of the element. O(n)

Returns the value find related to the key. O(n)

It tells us if the tree contains a key. O(n)

It tells us if the tree contains a key. O(n)

It tells us if the tree contains a value. O(n)

Returns a copy which is a different instance from the original tree. O(n^2)

Adds an couple of key and value. There are no repeated keys, if two elements have the same keys the value will be updated. Since this is a tree the elements will be order using the keys. O(log n)

Adds all the elements of an array. O(n*log n)

Removes an element from the tree, given the key of the element. O(log n)

Returns the value find related to the key. O(log n)

It tells us if the tree contains a key. O(log n)

It tells us if the tree contains a key. O(log n)

It tells us if the tree contains a value. O(n)

Returns a copy which is a different instance from the original tree. O(n)