diff --git a/arrays/push.md b/arrays/push.md new file mode 100644 index 00000000..e63fc63c --- /dev/null +++ b/arrays/push.md @@ -0,0 +1,10 @@ +# Push + +You can push certain items to an array making the last index the item you just added. + +```javascript +var array = [1, 2, 3]; + +array.push(4); + +console.log(array); diff --git a/arrays/shift.md b/arrays/shift.md new file mode 100644 index 00000000..64e01319 --- /dev/null +++ b/arrays/shift.md @@ -0,0 +1,10 @@ +# Shift + +What Shift does to an array is delete the first index of that array and move all indexes to the left. + +```javascript +var array = [1, 2, 3]; + +array.shift(); + +console.log(array); diff --git a/linked list/README.md b/linked list/README.md new file mode 100644 index 00000000..c5a9dcc3 --- /dev/null +++ b/linked list/README.md @@ -0,0 +1,13 @@ +# Linked Lists + +In all programming languages, there are data structures. One of these data structures are called Linked Lists. There is no built in method or function for Linked Lists in Javascript so you will have to implement it yourself. + +A Linked List is very similar to a normal array in Javascript, it just acts a little bit differently. + +In this chapter, we will go over the different ways we can implement a Linked List. + +Here's an example of a Linked List: + +``` +["one", "two", "three", "four"] +``` diff --git a/linked list/add.md b/linked list/add.md new file mode 100644 index 00000000..cc920440 --- /dev/null +++ b/linked list/add.md @@ -0,0 +1,32 @@ +# Add + +What we will do first is add a value to a Linked List. + +```js +class Node { + constructor(data) { + this.data = data + this.next = null + } +} + +class LinkedList { + constructor(head) { + this.head = head + } + + append = (value) => { + const newNode = new Node(value) + let current = this.head + + if (!this.head) { + this.head = newNode + return + } + + while (current.next) { + current = current.next + } + current.next = newNode + } +}