From b7f080688b87641aae9d2d1b14336458abb02d23 Mon Sep 17 00:00:00 2001 From: Sreekanth Date: Fri, 21 Oct 2022 10:30:40 +0530 Subject: [PATCH] Remove unnecessary comments --- structure/stack/array.go | 7 ------- structure/stack/doubly_linked_list_test.go | 9 --------- structure/stack/stack.go | 5 +++++ 3 files changed, 5 insertions(+), 16 deletions(-) diff --git a/structure/stack/array.go b/structure/stack/array.go index 0a4a7a52b5..9986f593fc 100644 --- a/structure/stack/array.go +++ b/structure/stack/array.go @@ -1,10 +1,3 @@ -// Stack implementation using Array -// Stack is a linear data structure in which the push and pop operations occur only at one end of the structure, referred to as the top of the stack. -// The order in which an element added to or removed from a stack is described as last in, first out (LIFO). -// Details: -// Stack Data Structure : https://www.geeksforgeeks.org/stack-data-structure-introduction-program/ -// Stack (abstract data type) : https://en.wikipedia.org/wiki/Stack_(abstract_data_type) - package stack import "errors" diff --git a/structure/stack/doubly_linked_list_test.go b/structure/stack/doubly_linked_list_test.go index 954de3ca7c..d9846df81d 100644 --- a/structure/stack/doubly_linked_list_test.go +++ b/structure/stack/doubly_linked_list_test.go @@ -1,12 +1,3 @@ -// Stack Test -// description: based on `geeksforgeeks` description Stack is a linear data structure which follows a particular order in which the operations are performed. -// The order may be LIFO(Last In First Out) or FILO(First In Last Out). -// details: -// Stack Data Structure : https://www.geeksforgeeks.org/stack-data-structure-introduction-program/ -// Stack (abstract data type) : https://en.wikipedia.org/wiki/Stack_(abstract_data_type) -// author [Milad](https://github.com/miraddo) -// see stackarray.go, stacklinkedlist.go, stacklinkedlistwithlist.go - package stack import ( diff --git a/structure/stack/stack.go b/structure/stack/stack.go index 872cb2293e..ba49583f47 100644 --- a/structure/stack/stack.go +++ b/structure/stack/stack.go @@ -1,3 +1,8 @@ +// Stack is a linear data structure in which the push and pop operations occur only at one end of the structure, referred to as the top of the stack. +// The order in which an element added to or removed from a stack is described as last in, first out (LIFO). +// +// Stack Data Structure : https://www.geeksforgeeks.org/stack-data-structure-introduction-program/ +// Stack (abstract data type) : https://en.wikipedia.org/wiki/Stack_(abstract_data_type) package stack // Interface defines the specifications for a stack implementation.