Functions — github.com/Dentrax/Data-Structures-with-Go

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

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

⨍ Functions 142◇ Types & classes 16

↓ 16 callersFunctionNew

Returns an new list

binary-tree-1-introduction/binary-tree-1-introduction.go:27

↓ 9 callersFunctionPush

(head_ref **Node, new_data int)

linked-list-merge-two-sorted/linked-list-merge-two-sorted.go:42

↓ 8 callersFunctionNew

Returns an new list

linked-list-merge-two-sorted/linked-list-merge-two-sorted.go:24

↓ 8 callersFunctionNew

Returns an new list

binary-tree-5-find-min-max/binary-tree-5-find-min-max.go:32

↓ 7 callersFunctionInsert

A utility function to insert a new node with given key in BST

binary-search-tree-1-insertion/binary-search-tree-1-insertion.go:58

↓ 7 callersFunctionNew

Returns an new list

linked-list-circular-singly-1-insertion/linked-list-circular-singly-1-insertion.go:24

↓ 7 callersFunctionNew

Returns an new list

linked-list-reverse/linked-list-reverse.go:24

↓ 6 callersFunctionNew

Returns an new list

binary-tree-3-doubly-linked-list/binary-tree-3-doubly-linked-list.go:27

↓ 5 callersFunctionNew

Returns an new list

binary-tree-4-delete/binary-tree-4-delete.go:27

↓ 5 callersFunctionNew

Returns an new list

binary-tree-2-traversals-in-pre-post-order/binary-tree-traversals-2-in-pre-post-order.go:27

↓ 5 callersFunctionNew

Returns an new list

binary-search-tree-1-insertion/binary-search-tree-1-insertion.go:27

↓ 5 callersFunctionNew

Returns an new list

stack/stack.go:32

↓ 5 callersFunctionNew

Returns an new list

binary-tree-2-traversals-level-order/binary-tree-traversals-2-level-order.go:27

↓ 5 callersFunctionPush

(head_ref **Node, new_data int)

linked-list-find-length/linked-list-find-length.go:42

↓ 5 callersFunctionPush

(head_ref **Node, new_data int)

linked-list-3-deleting-a-node/linked-list-3-deleting-a-node.go:42

↓ 5 callersFunctionPush

(head_ref **Node, new_data int)

linked-list-reverse/linked-list-reverse.go:42

↓ 4 callersFunctionNew

Returns an new list

linked-list-2-inserting-a-node/linked-list-2-inserting-a-node.go:24

↓ 4 callersFunctionPush

(stack *Stack, item int)

stack/stack.go:46

↓ 4 callersFunctionPush

(head_ref **Node, new_data int)

linked-list-circular-2-traversal/linked-list-circular-2-traversal.go:50

↓ 3 callersFunctionAbs

(x int)

array-minimum-distance/array-minimum-distance.go:17

↓ 3 callersFunctionAddToEmpty

Function to insert node in an empty List

linked-list-circular-singly-1-insertion/linked-list-circular-singly-1-insertion.go:43

↓ 3 callersFunctionNew

Returns an new list

linked-list-1-introduction/linked-list-1-introduction.go:24

↓ 2 callersFunctionAddBegin

Function to insert node in the beginning of the List

linked-list-circular-singly-1-insertion/linked-list-circular-singly-1-insertion.go:62

↓ 2 callersFunctionAddEnd

Function to insert node in the end of the List

linked-list-circular-singly-1-insertion/linked-list-circular-singly-1-insertion.go:81

↓ 2 callersFunctionAppend

(head_ref **Node, new_data int)

linked-list-2-inserting-a-node/linked-list-2-inserting-a-node.go:79

↓ 2 callersFunctionGetDataList

(n *Node)

linked-list-merge-two-sorted/linked-list-merge-two-sorted.go:129

↓ 2 callersFunctionMergeSort

(arr []int, l, r int)

merge-sort/merge-sort.go:61

↓ 2 callersFunctionMoveNode

Pull off the front node of the source and put it in dest * MoveNode() function takes the node from the front of the source, and move it to the fron

linked-list-merge-two-sorted/linked-list-merge-two-sorted.go:71

↓ 2 callersFunctionNew

Returns an new list

linked-list-find-length/linked-list-find-length.go:24

↓ 2 callersFunctionNew

Returns an new list

linked-list-3-deleting-a-node/linked-list-3-deleting-a-node.go:24

↓ 2 callersFunctionNew

Returns an new list

linked-list-circular-2-traversal/linked-list-circular-2-traversal.go:24

↓ 2 callersFunctionPop

(stack *Stack)

stack/stack.go:54

↓ 2 callersFunctionPrintArray

(A []int, size int)

merge-sort/merge-sort.go:74

↓ 2 callersFunctionPush

(head_ref **Node, new_data int)

linked-list-2-inserting-a-node/linked-list-2-inserting-a-node.go:42

↓ 2 callersFunctionQuickSort

*The main function that implements QuickSort arr[] -> Array to be sorted start -> Starting index end -> Ending index */

quick-sort/quick-sort.go:43

↓ 2 callersFunctionReverse

(head_ref **Node)

linked-list-reverse/linked-list-reverse.go:59

↓ 2 callersFunctionSortedMerge

* Takes two lists sorted in increasing order, and splices their nodes together to make one big sorted list which is returned. */

linked-list-merge-two-sorted/linked-list-merge-two-sorted.go:88

↓ 2 callersFunctionSwap

(a *int, b *int)

quick-sort/quick-sort.go:12

↓ 2 callersFunctionfindFirstMissing

(arr []int, start, end int)

array-smallest-missing-number/array-smallest-missing-number.go:13

↓ 2 callersFunctionleftRotate

(arr []int, d int, n int)

array-rotation/array-rotation.go:12

↓ 2 callersFunctionminDist

(arr []int, n, x, y int)

array-minimum-distance/array-minimum-distance.go:27

↓ 2 callersFunctionprintArray

(arr []int, size int)

array-rotation/array-rotation.go:27

↓ 2 callersFunctionprintList

This function prints contents of linked list starting from the given node

linked-list-3-deleting-a-node/linked-list-3-deleting-a-node.go:125

↓ 2 callersFunctionprintList

This function prints contents of linked list starting from the given node

linked-list-reverse/linked-list-reverse.go:75

↓ 1 callersFunctionAddAfter

Function to insert node in the end of the List

linked-list-circular-singly-1-insertion/linked-list-circular-singly-1-insertion.go:101

↓ 1 callersFunctionBTToDLL

(root *Node)

binary-tree-3-doubly-linked-list/binary-tree-3-doubly-linked-list.go:81

↓ 1 callersFunctionDeleteNodeWithData

(head_ref **Node, delete_data int)

linked-list-3-deleting-a-node/linked-list-3-deleting-a-node.go:59

↓ 1 callersFunctionDeleteNodeWithPosition

(head_ref **Node, delete_position int)

linked-list-3-deleting-a-node/linked-list-3-deleting-a-node.go:88

↓ 1 callersFunctionDeleteTree

* Compute the "height" of a tree -- the number of nodes along the longest path from the root node down to the farthest leaf node.*/

binary-tree-4-delete/binary-tree-4-delete.go:34

↓ 1 callersFunctionFindMax

Returns maximum value in a given Binary Tree

binary-tree-5-find-min-max/binary-tree-5-find-min-max.go:59

↓ 1 callersFunctionFindMin

Returns minimum value in a given Binary Tree

binary-tree-5-find-min-max/binary-tree-5-find-min-max.go:37

↓ 1 callersFunctionFixNextPtr

(root *Node)

binary-tree-3-doubly-linked-list/binary-tree-3-doubly-linked-list.go:63

↓ 1 callersFunctionFixPrevPtr

(root *Node)

binary-tree-3-doubly-linked-list/binary-tree-3-doubly-linked-list.go:48

↓ 1 callersFunctionGetCount

(head *Node)

linked-list-find-length/linked-list-find-length.go:59

↓ 1 callersFunctionGetHeight

* Compute the "height" of a tree -- the number of nodes along the longest path from the root node down to the farthest leaf node.*/

binary-tree-2-traversals-level-order/binary-tree-traversals-2-level-order.go:34

↓ 1 callersFunctionInOrder

Standard Inorder traversal of tree

binary-tree-3-doubly-linked-list/binary-tree-3-doubly-linked-list.go:32

↓ 1 callersMethodInit

Returns an initialized list

linked-list-find-length/linked-list-find-length.go:18

↓ 1 callersMethodInit

Returns an initialized list

binary-tree-4-delete/binary-tree-4-delete.go:19

↓ 1 callersMethodInit

Returns an initialized list

linked-list-merge-two-sorted/linked-list-merge-two-sorted.go:18

↓ 1 callersMethodInit

Returns an initialized list

binary-tree-2-traversals-in-pre-post-order/binary-tree-traversals-2-in-pre-post-order.go:19

↓ 1 callersMethodInit

Returns an initialized list

binary-tree-1-introduction/binary-tree-1-introduction.go:19

↓ 1 callersMethodInit

Returns an initialized list

binary-search-tree-1-insertion/binary-search-tree-1-insertion.go:19

↓ 1 callersMethodInit

Returns an initialized list

stack/stack.go:24

↓ 1 callersMethodInit

Returns an initialized list

linked-list-1-introduction/linked-list-1-introduction.go:18

↓ 1 callersMethodInit

Returns an initialized list

binary-tree-5-find-min-max/binary-tree-5-find-min-max.go:24

↓ 1 callersMethodInit

Returns an initialized list

linked-list-circular-singly-1-insertion/linked-list-circular-singly-1-insertion.go:18

↓ 1 callersMethodInit

Returns an initialized list

linked-list-3-deleting-a-node/linked-list-3-deleting-a-node.go:18

↓ 1 callersMethodInit

Returns an initialized list

linked-list-circular-2-traversal/linked-list-circular-2-traversal.go:18

↓ 1 callersMethodInit

Returns an initialized list

linked-list-2-inserting-a-node/linked-list-2-inserting-a-node.go:18

↓ 1 callersMethodInit

Returns an initialized list

binary-tree-3-doubly-linked-list/binary-tree-3-doubly-linked-list.go:19

↓ 1 callersMethodInit

Returns an initialized list

linked-list-reverse/linked-list-reverse.go:18

↓ 1 callersMethodInit

Returns an initialized list

binary-tree-2-traversals-level-order/binary-tree-traversals-2-level-order.go:19

↓ 1 callersFunctionInsertAfter

(prev_node *Node, new_data int)

linked-list-2-inserting-a-node/linked-list-2-inserting-a-node.go:59

↓ 1 callersFunctionIsEmpty

Stack is empty when top is equal to -1

stack/stack.go:42

↓ 1 callersFunctionIsFull

Stack is full when top is equal to the last index

stack/stack.go:37

↓ 1 callersFunctionMerge

(arr []int, l, m, r int)

merge-sort/merge-sort.go:12

↓ 1 callersMethodNext

Returns the first node in list

linked-list-reverse/linked-list-reverse.go:29

↓ 1 callersFunctionPartition

(arr []int, start, end int)

quick-sort/quick-sort.go:18

↓ 1 callersFunctionPrintArray

(arr []int, size int)

quick-sort/quick-sort.go:54

↓ 1 callersFunctionPrintGivenLevel

* Print nodes at a given level */

binary-tree-2-traversals-level-order/binary-tree-traversals-2-level-order.go:52

↓ 1 callersFunctionPrintInOrder

(node *Node)

binary-tree-2-traversals-in-pre-post-order/binary-tree-traversals-2-in-pre-post-order.go:47

↓ 1 callersFunctionPrintInOrder

A utility function to do inorder traversal of BST

binary-search-tree-1-insertion/binary-search-tree-1-insertion.go:49

↓ 1 callersFunctionPrintLevelOrder

* Function to print level order traversal a tree*/

binary-tree-2-traversals-level-order/binary-tree-traversals-2-level-order.go:67

↓ 1 callersFunctionPrintList

(root *Node)

binary-tree-3-doubly-linked-list/binary-tree-3-doubly-linked-list.go:89

↓ 1 callersFunctionPrintPostOrder

(node *Node)

binary-tree-2-traversals-in-pre-post-order/binary-tree-traversals-2-in-pre-post-order.go:31

↓ 1 callersFunctionPrintPreOrder

(node *Node)

binary-tree-2-traversals-in-pre-post-order/binary-tree-traversals-2-in-pre-post-order.go:63

↓ 1 callersFunctionSearch

Function to search a given key in a given BST

binary-search-tree-1-insertion/binary-search-tree-1-insertion.go:32

↓ 1 callersFunctionTraverse

(last *Node)

linked-list-circular-singly-1-insertion/linked-list-circular-singly-1-insertion.go:137

↓ 1 callersFunctionleftRotateByOne

(arr []int, n int)

array-rotation/array-rotation.go:18

↓ 1 callersFunctionprintList

This function prints contents of linked list starting from the given node

linked-list-merge-two-sorted/linked-list-merge-two-sorted.go:121

↓ 1 callersFunctionprintList

This function prints contents of linked list starting from the given node

linked-list-1-introduction/linked-list-1-introduction.go:43

↓ 1 callersFunctionprintList

This function prints contents of linked list starting from the given node

linked-list-circular-2-traversal/linked-list-circular-2-traversal.go:43

↓ 1 callersFunctionprintList

This function prints contents of linked list starting from the given node

linked-list-2-inserting-a-node/linked-list-2-inserting-a-node.go:108

MethodBack

Returns the last node in list if exist, otherwise returns current

linked-list-find-length/linked-list-find-length.go:34

MethodBack

Returns the last node in list if exist, otherwise returns current

linked-list-merge-two-sorted/linked-list-merge-two-sorted.go:34

MethodBack

Returns the last node in list if exist, otherwise returns current

linked-list-1-introduction/linked-list-1-introduction.go:34

MethodBack

Returns the last node in list if exist, otherwise returns current

linked-list-circular-singly-1-insertion/linked-list-circular-singly-1-insertion.go:34

MethodBack

Returns the last node in list if exist, otherwise returns current

linked-list-3-deleting-a-node/linked-list-3-deleting-a-node.go:34

MethodBack

Returns the last node in list if exist, otherwise returns current

linked-list-circular-2-traversal/linked-list-circular-2-traversal.go:34

MethodBack

Returns the last node in list if exist, otherwise returns current

linked-list-2-inserting-a-node/linked-list-2-inserting-a-node.go:34

next →1–100 of 142, ranked by callers