@@ -2,8 +2,8 @@ import LinkedList from '../linked-list/LinkedList';
22
33export default class Stack {
44constructor ( ) {
5- // We're going to implementQueue based on LinkedList sincethis
6- // structuresa quite similar. Compare push/pop operations of the Stack
5+ // We're going to implementStack based on LinkedList sincethese
6+ // structuresare quite similar. Compare push/pop operations of the Stack
77// with append/deleteTail operations of LinkedList.
88this . linkedList = new LinkedList ( ) ;
99}
@@ -12,7 +12,7 @@ export default class Stack {
1212 *@return {boolean }
1313 */
1414isEmpty ( ) {
15- // Thequeue is emptyin case if its linked listdon 't have tail.
15+ // Thestack is empty if its linked listdoesn 't have a tail.
1616return ! this . linkedList . tail ;
1717}
1818
@@ -21,7 +21,7 @@ export default class Stack {
2121 */
2222peek ( ) {
2323if ( this . isEmpty ( ) ) {
24- // If linked list is empty then there is nothing to peek from.
24+ // Ifthe linked list is empty then there is nothing to peek from.
2525return null ;
2626}
2727
@@ -34,16 +34,16 @@ export default class Stack {
3434 */
3535push ( value ) {
3636// Pushing means to lay the value on top of the stack. Therefore let's just add
37- // new value at the end of the linked list.
37+ //the new value at the end of the linked list.
3838this . linkedList . append ( value ) ;
3939}
4040
4141/**
4242 *@return {* }
4343 */
4444pop ( ) {
45- // Let's try to delete the last nodefrom linked list (the tail).
46- // If there is no tailin linked list (it is empty) just return null.
45+ // Let's try to delete the last node (the tail) from the linked list .
46+ // If there is no tail(the linked list is empty) just return null.
4747const removedTail = this . linkedList . deleteTail ( ) ;
4848return removedTail ?removedTail . value :null ;
4949}