MCPcopy Create free account

hub / github.com/Dentrax/Data-Structures-with-Go / functions

Functions142 in github.com/Dentrax/Data-Structures-with-Go

⨍ Functions 142◇ Types & classes 16
MethodBack
Returns the last node in list if exist, otherwise returns current
linked-list-reverse/linked-list-reverse.go:34
MethodNext
Returns the first node in list
linked-list-find-length/linked-list-find-length.go:29
MethodNext
Returns the first node in list
linked-list-merge-two-sorted/linked-list-merge-two-sorted.go:29
MethodNext
Returns the first node in list
linked-list-1-introduction/linked-list-1-introduction.go:29
MethodNext
Returns the first node in list
linked-list-circular-singly-1-insertion/linked-list-circular-singly-1-insertion.go:29
MethodNext
Returns the first node in list
linked-list-3-deleting-a-node/linked-list-3-deleting-a-node.go:29
MethodNext
Returns the first node in list
linked-list-circular-2-traversal/linked-list-circular-2-traversal.go:29
MethodNext
Returns the first node in list
linked-list-2-inserting-a-node/linked-list-2-inserting-a-node.go:29
FunctionTestAbs
(t *testing.T)
array-minimum-distance/array-minimum-distance_test.go:15
FunctionTestBinarySearchTreeNew
(t *testing.T)
binary-search-tree-1-insertion/binary-search-tree-1-insertion_test.go:15
FunctionTestBinaryTreeNew
(t *testing.T)
binary-tree-1-introduction/binary-tree-1-introduction_test.go:15
FunctionTestFindFirstMissing
(t *testing.T)
array-smallest-missing-number/array-smallest-missing-number_test.go:15
FunctionTestLeftRotate
(t *testing.T)
array-rotation/array-rotation_test.go:15
FunctionTestLinkedListReverse
(t *testing.T)
linked-list-reverse/linked-list-reverse_test.go:15
FunctionTestMergeSort
(t *testing.T)
merge-sort/merge-sort_test.go:15
FunctionTestMergeTwoSortedNew
(t *testing.T)
linked-list-merge-two-sorted/linked-list-merge-two-sorted.go_test.go:15
FunctionTestMinDist
(t *testing.T)
array-minimum-distance/array-minimum-distance_test.go:37
FunctionTestQuickSort
(t *testing.T)
quick-sort/quick-sort_test.go:15
FunctionTestStack
(t *testing.T)
stack/stack_test.go:15
Functionmain
()
array-smallest-missing-number/array-smallest-missing-number.go:37
Functionmain
()
linked-list-find-length/linked-list-find-length.go:79
Functionmain
()
binary-tree-4-delete/binary-tree-4-delete.go:50
Functionmain
()
linked-list-merge-two-sorted/linked-list-merge-two-sorted.go:138
Functionmain
()
binary-tree-2-traversals-in-pre-post-order/binary-tree-traversals-2-in-pre-post-order.go:79
Functionmain
()
merge-sort/merge-sort.go:81
Functionmain
()
array-rotation/array-rotation.go:37
Functionmain
()
binary-tree-1-introduction/binary-tree-1-introduction.go:31
Functionmain
()
binary-search-tree-1-insertion/binary-search-tree-1-insertion.go:75
Functionmain
()
stack/stack.go:63
Functionmain
()
linked-list-1-introduction/linked-list-1-introduction.go:50
Functionmain
()
binary-tree-5-find-min-max/binary-tree-5-find-min-max.go:80
Functionmain
()
quick-sort/quick-sort.go:61
Functionmain
()
linked-list-circular-singly-1-insertion/linked-list-circular-singly-1-insertion.go:164
Functionmain
()
array-minimum-distance/array-minimum-distance.go:41
Functionmain
()
linked-list-3-deleting-a-node/linked-list-3-deleting-a-node.go:132
Functionmain
()
linked-list-circular-2-traversal/linked-list-circular-2-traversal.go:72
Functionmain
()
linked-list-2-inserting-a-node/linked-list-2-inserting-a-node.go:115
Functionmain
()
binary-tree-3-doubly-linked-list/binary-tree-3-doubly-linked-list.go:96
Functionmain
()
linked-list-reverse/linked-list-reverse.go:82
Functionmain
()
binary-tree-2-traversals-level-order/binary-tree-traversals-2-level-order.go:81
FunctionprintList
This function prints contents of linked list starting from the given node
linked-list-find-length/linked-list-find-length.go:72
FunctionprintList
This function prints contents of linked list starting from the given node
linked-list-circular-singly-1-insertion/linked-list-circular-singly-1-insertion.go:157
← previous101–142 of 142, ranked by callers