This is a personal repositories for my personal studies about some programing topics...

Data structures types

Was create for studies porposes based on the articles

https://medium.com/amiralles/mastering-data-structures-in-ruby-linked-lists-708347a30360
https://medium.com/amiralles/mastering-data-structures-in-ruby-doubly-linked-lists-e5e5aff5ff67
https://medium.com/amiralles/mastering-data-structures-in-ruby-circular-linked-lists-8bd35769cc5
https://medium.com/amiralles/stacks-are-a-special-kind-of-linked-lists-that-allow-us-to-efficiently-store-retrieve-data-in-last-9efab58fd100
https://medium.com/amiralles/mastering-data-structures-in-ruby-persistent-lists-d1449e8c4c99
https://medium.com/amiralles/mastering-data-structures-in-ruby-graphs-caa5892d50b1
https://medium.com/amiralles/mastering-data-structures-in-ruby-binary-trees-e7c001050a52

Interface

LinkedList

Method	Summary	Complexity
#initialize	Initializes an Empty list	O(1)
#insert(item)	Inserts a new item into the list	O(1)
#remove(item)	Removes an item from the list	O(n)
#cat(list)	Catenates a list to the current list	O(1)
#clear	Remove all items from the list	O(n)
#find_first(&predicate)	Returns the first element that matches the predicate	O(n)
#each	loops over the list yielding one element at time.	O(n)
#print	Prints the contents of the list	O(n)

DoubleLinkedList

Method	Summary	Complexity
#initialize	Initializes an Empty list	O(1)
#insert(item)	Inserts a new item into the list	O(1)
#remove(item)	Removes an item from the list	O(1)
#cat(list)	Catenates a list to the current list	O(1)
#clear	Remove all items from the list	O(n)
#find_first(&predicate)	Returns the first element that matches the predicate	O(n)
#each	loops over the list yielding one element at time.	O(n)
#print	Prints the contents of the list	O(n)
#find_last(&predicate)	Returns the last element that matches the predicate	O(n)
#reverse_print	Loops over the list backward yielding one element at a time.	O(n)
#reverse_each	Prints the contents of the list backward	O(n)

CircularList

Method	Summary	Complexity
#initialize	Initializes an Empty list	O(1)
#insert(item)	Inserts a new item into the list	O(n)
#insert_next(prev_node,item)	Inserts a new item into the list, right next to the previous node.	O(1)
#remove(item)	Removes an item from the list	O(n)
#remove_next(prev_node)	Removes the element the is next to previous node	O(1)
#clear	Remove all items from the list	O(n)
#find_first(&predicate)	Returns the first element that matches the predicate	O(n)
#move_next	Sets the current node to point to the next node in the list	O(1)
#full_scan	Traverses all elements in the list starting from the head node	O(n)
#print	Prints the contents of the list	O(n)

Stack

Method	Summary	Complexity
#initialize	Initializes an Empty stack	O(1)
#push(item)	Inserts a new item into the stack	O(1)
#pop	Removes an item from the top of the stack	O(1)
#peek	Returns the item that's the top of the stack	O(1)
#clear	Pop all elements from the stack	O(n)
#each	Loops over the stack yielding one element at a time	O(n)
#print	Prints the contents of the stack	O(n)

Persistent List

Method	Summary	Complexity
#empty	Initializes an Empty list.	O(n)
#insert(list,data)	Inserts a new item into a copy of the specific list.	O(n)
#update(list,node,data)	Updates a value into a copy of the specified list.	O(n)
#remove(list,node)	Removes an item from a copy of the specified list.	O(n)
#cat(list1,list2)	Creates a list that contains a copy of all nodes from list1 and list2.	O(n)
#len(list)	Returns a number of elements on the specified list.	O(1)
#find_first(list,&predicate)	Returns the first element that matches the predicate on the specified list.	O(n)
#each(list,&block)	Loops over the specified list calling the given block passing one element at a time.	O(n)
#print(list)	Print the contents of the specified list.	O(n)

Graph

Method	Summary	Complexity
#insert_vertex(key)	Adds a vertex (node) to the graph.	O(1)
#insert_edge(key1, key2)	Connects two vertices by adding an edge to the graph.	O(n)
#remove_vertex(key)	Removes a vertex to the graph.	O(n+e)
#remove_edge(key1, key2)	Disconects two vertices by removing the edge that connects them.	O(n)
#adjacent?(key1, key2)	Tells if two vertices are adjacent or not.	O(n)
#find_vertex(key)	Finds a vertex in the current graph.	O(1)
#print	Prints the contents of the current graph	O(n+e)

Simple Binary Tree

Method	Summary	Complexity
#insert_left(node, data)	Inserts a new node at the left child of the specified node.	O(1)
#insert_right(node, data)	Inserts a new node at the right child of the specified node.	O(1)
#remove_left(node)	Removes the subtree rooted at the left child of the specified node.	O(n)
#remove_right(node)	Removes the subtree rooted at the right child of the specified node.	O(n)
#merge(left, right)	Produces a new tree by merging left and right.	O(n)
#print	Prints the contents of the current tree	O(n)