Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/odilson-dev/linked-list
A linked list is a linear collection of data elements called nodes that “point” to the next node by means of a pointer.
https://github.com/odilson-dev/linked-list
Last synced: 2 days ago
JSON representation
A linked list is a linear collection of data elements called nodes that “point” to the next node by means of a pointer.
- Host: GitHub
- URL: https://github.com/odilson-dev/linked-list
- Owner: odilson-dev
- Created: 2023-10-04T21:12:19.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2023-10-05T02:56:58.000Z (about 1 year ago)
- Last Synced: 2024-05-17T15:26:41.570Z (6 months ago)
- Language: Ruby
- Size: 3.91 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Linked-list
A linked list is a linear collection of data elements called nodes that “point” to the next node by means of a pointer.
You will need two classes:LinkedList class, which will represent the full list.
Node class, containing a #value method and a link to the #next_node, set both as nil by default.
Build the following methods in your linked list class:#append(value) adds a new node containing value to the end of the list
#prepend(value) adds a new node containing value to the start of the list
#size returns the total number of nodes in the list
#head returns the first node in the list
#tail returns the last node in the list
#at(index) returns the node at the given index
#pop removes the last element from the list
#contains?(value) returns true if the passed in value is in the list and otherwise returns false.
#find(value) returns the index of the node containing value, or nil if not found.
#to_s represent your LinkedList objects as strings, so you can print them out and preview them in the console. The format should be: ( value ) -> ( value ) -> ( value ) -> nil
Extra credit
#insert_at(value, index) that inserts a new node with the provided value at the given index.
#remove_at(index) that removes the node at the given index.# Lesson Link
https://www.theodinproject.com/lessons/ruby-linked-lists