Functions — github.com/careermonk/data-structures-and-algorithms-made-easy-in-java

hub / github.com/careermonk/data-structures-and-algorithms-made-easy-in-java / functions

Functions490 in github.com/careermonk/data-structures-and-algorithms-made-easy-in-java

⨍ Functions 490◇ Types & classes 176

↓ 77 callersMethodgetLeft

()

src/chapter06trees/BinaryTreeNode.java:36

↓ 41 callersMethodgetNext

()

src/chapter03linkedlists/DLLNode.java:46

↓ 41 callersMethodgetNext

()

src/chapter03linkedlists/ListNode.java:32

↓ 39 callersMethodadd

(T key, U value)

src/chapter03linkedlists/SkipList.java:52

↓ 34 callersMethodpush

(int value)

src/chapter04stacks/StackSets.java:45

↓ 29 callersMethodprint

(String s, Trie t)

src/chapter15stringalgorithms/Trie.java:41

↓ 27 callersMethodlength

()

src/chapter03linkedlists/LinkedList.java:204

↓ 27 callersMethodpop

()

src/chapter04stacks/StackSets.java:63

↓ 23 callersMethodisEmpty

()

src/chapter03linkedlists/LinkedList.java:227

↓ 19 callersMethodgetRight

()

src/chapter06trees/BinaryTreeNode.java:42

↓ 17 callersMethodgetData

()

src/chapter03linkedlists/DLLNode.java:34

↓ 17 callersMethodsetNext

(ListNode node)

src/chapter03linkedlists/ListNode.java:37

↓ 16 callersMethodisEmpty

()

src/chapter04stacks/LinkedStack.java:61

↓ 14 callersMethodget

(T key)

src/chapter03linkedlists/SkipList.java:103

↓ 13 callersMethodsetNext

(DLLNode where)

src/chapter03linkedlists/DLLNode.java:54

↓ 10 callersMethodgetData

()

src/chapter06trees/BinaryTreeNode.java:30

↓ 10 callersMethodpeek

()

src/chapter04stacks/LinkedStack.java:53

↓ 8 callersMethodgetData

()

src/chapter03linkedlists/CLLNode.java:44

↓ 7 callersMethodgetNext

()

src/chapter03linkedlists/CLLNode.java:34

↓ 7 callersMethodgetPrev

()

src/chapter03linkedlists/DLLNode.java:42

↓ 7 callersMethodisEmpty

()

src/chapter05queues/LinkedQueue.java:65

↓ 7 callersMethodprocessDecimal

(int decimal, int lastNumber, int lastDecimal)

src/chapter21miscconcepts/RomanToDecimal.java:77

↓ 7 callersMethodsize

()

src/chapter04stacks/LinkedStack.java:66

↓ 6 callersMethodAppend

(strip str)

src/chapter18divideandconquer/SkylinesDivideandConquer.java:31

↓ 6 callersMethodHead

()

src/chapter18divideandconquer/SkylinesDivideandConquer.java:34

↓ 6 callersMethodaddString

(String s)

src/chapter15stringalgorithms/Trie.java:28

↓ 6 callersMethodcompareTo

(HuffmanTreeNode node)

src/chapter17greedyalgorithms/HuffmanTreeNode.java:37

↓ 6 callersMethodgetData

()

src/chapter03linkedlists/ListNode.java:42

↓ 5 callersMethodadd

(Integer data)

src/chapter09graphs/GraphAdjacencyList.java:40

↓ 5 callersMethodsetNext

(CLLNode node)

src/chapter03linkedlists/CLLNode.java:39

↓ 5 callersMethodsetPrev

(DLLNode where)

src/chapter03linkedlists/DLLNode.java:50

↓ 5 callersMethodsize

()

src/chapter04stacks/DynamicArrayStack.java:45

↓ 5 callersMethodtoString

()

src/chapter09graphs/BFS.java:102

↓ 4 callersMethodRemoveHead

()

src/chapter18divideandconquer/SkylinesDivideandConquer.java:37

↓ 4 callersMethodisEmpty

( )

src/chapter07priorityqueues/BinaryHeap.java:91

↓ 4 callersMethodreverse

(String s)

src/chapter15stringalgorithms/ReverseWordsinaSentence.java:43

↓ 4 callersMethodsetLeft

(BinaryTreeNode left)

src/chapter06trees/BinaryTreeNode.java:39

↓ 4 callersMethodsetNextSibling

(SiblingBinaryTreeNode nextSibling)

src/chapter06trees/SiblingBinaryTreeNode.java:56

↓ 4 callersMethodsize

()

src/chapter04stacks/FixedSizeArrayStack.java:42

↓ 4 callersMethodvalidateVertex

(int u)

src/chapter09graphs/GraphAdjacencyList.java:132

↓ 3 callersMethodclear

()

src/chapter03linkedlists/CircularLinkedList.java:150

↓ 3 callersMethoddeleteMin

( )

src/chapter07priorityqueues/BinaryHeap.java:72

↓ 3 callersMethodfind

(int x)

src/chapter08disjointsets/DisjointSets.java:38

↓ 3 callersMethodgetLeftNode

()

src/chapter17greedyalgorithms/HuffmanTreeNode.java:48

↓ 3 callersMethodgetRightNode

()

src/chapter17greedyalgorithms/HuffmanTreeNode.java:49

↓ 3 callersMethodgetWeight

()

src/chapter17greedyalgorithms/HuffmanTreeNode.java:45

↓ 3 callersMethodisEmpty

()

src/chapter17greedyalgorithms/Huffman.java:134

↓ 3 callersMethodpartition

(int[] A, int start, int end)

src/chapter12selectionalgorithms/KthSmallest.java:16

↓ 3 callersMethodpartition

(int[] A, int start, int end)

src/chapter12selectionalgorithms/KthLargest.java:16

↓ 3 callersMethodpush

(int v)

src/chapter04stacks/StackForStackSets.java:29

↓ 2 callersMethodV

()

src/chapter09graphs/GraphAdjacencyList.java:122

↓ 2 callersMethodaddToHead

(int data)

src/chapter03linkedlists/CircularLinkedList.java:33

↓ 2 callersMethodcontainsKey

(T key)

src/chapter03linkedlists/SkipList.java:80

↓ 2 callersMethodgetCharacter

()

src/chapter17greedyalgorithms/HuffmanTreeNode.java:46

↓ 2 callersMethodgetHeight

(BinarySearchTreeNode root)

src/chapter06trees/CheckAVL.java:21

↓ 2 callersMethodgetLastStack

()

src/chapter04stacks/StackSets.java:28

↓ 2 callersMethodgetLeft

()

src/chapter06trees/SiblingBinaryTreeNode.java:41

↓ 2 callersMethodgetNextSibling

()

src/chapter06trees/SiblingBinaryTreeNode.java:53

↓ 2 callersMethodhasNext

()

src/chapter09graphs/BFS.java:81

↓ 2 callersMethodheight

(BinaryTreeNode root)

src/chapter06trees/DiameterOfTree.java:42

↓ 2 callersMethodinsert

(int data, int position)

src/chapter03linkedlists/LinkedList.java:54

↓ 2 callersMethodisEmpty

()

src/chapter04stacks/FixedSizeArrayStack.java:47

↓ 2 callersMethodisEmpty

()

src/chapter04stacks/DynamicArrayStack.java:50

↓ 2 callersMethodisEmpty

()

src/chapter09graphs/GraphAdjacencyList.java:32

↓ 2 callersMethodisEndOfString

(String s)

src/chapter15stringalgorithms/Trie.java:52

↓ 2 callersMethodoptimalJumps

(int[] A)

src/chapter19dynamicprogramming/OptimalJumps.java:24

↓ 2 callersMethodpercolateDown

( int hole )

src/chapter07priorityqueues/BinaryHeap.java:106

↓ 2 callersMethodpop

()

src/chapter04stacks/StackForStackSets.java:33

↓ 2 callersMethodpop

()

src/chapter05queues/StackwithTwoQueues.java:26

↓ 2 callersMethodpush

(T data)

src/chapter05queues/StackwithTwoQueues.java:21

↓ 2 callersMethodremove

()

src/chapter09graphs/BFS.java:96

↓ 2 callersMethodrotateByOneElementClockwise

(int[][] matrix)

src/chapter21miscconcepts/SquareMatrixRotationByOneElement.java:18

↓ 2 callersMethodsetLeftNode

(HuffmanTreeNode left)

src/chapter17greedyalgorithms/HuffmanTreeNode.java:56

↓ 2 callersMethodsetRightNode

(HuffmanTreeNode right)

src/chapter17greedyalgorithms/HuffmanTreeNode.java:57

↓ 2 callersMethodsize

()

src/chapter04stacks/StackForStackSets.java:44

↓ 2 callersMethodsize

()

src/chapter03linkedlists/CircularLinkedList.java:135

↓ 2 callersMethodsize

(BinaryTreeNode root)

src/chapter06trees/BinaryTreeSizeRecursive.java:19

↓ 2 callersMethodsize

()

src/chapter05queues/LinkedQueue.java:70

↓ 2 callersMethodsort

(Stack<Integer> stk)

src/chapter04stacks/SortingStack.java:18

↓ 2 callersMethodswap

(int A[],int low,int high)

src/chapter10sorting/ConvertArraytoSawToothWaveLinearTime.java:29

↓ 2 callersMethodswap

(int[] A, int i, int j)

src/chapter12selectionalgorithms/KthSmallest.java:80

↓ 2 callersMethodswap

(int[] A, int i, int j)

src/chapter12selectionalgorithms/KthLargest.java:80

↓ 2 callersMethodtoString

()

src/chapter03linkedlists/ListNode.java:52

↓ 2 callersMethodtoString1

()

src/chapter06trees/BinaryTreeNode.java:49

↓ 1 callersMethodBFS

()

src/chapter09graphs/BFS.java:121

↓ 1 callersMethodCountingSort

(int[] A, int K)

src/chapter10sorting/CountingSort.java:17

↓ 1 callersMethodDFS

()

src/chapter09graphs/DFS.java:121

↓ 1 callersMethodE

()

src/chapter09graphs/GraphAdjacencyList.java:127

↓ 1 callersMethodMergeSkylines

(Skyline SK1, Skyline SK2)

src/chapter18divideandconquer/SkylinesDivideandConquer.java:65

↓ 1 callersMethodPartition

(int[] A, int low, int high)

src/chapter10sorting/QuickSort.java:28

↓ 1 callersMethodaddEdge

(int u, int v)

src/chapter09graphs/BFS.java:52

↓ 1 callersMethodaddEdge

(int u, int v)

src/chapter09graphs/GraphAdjacencyMatrix.java:54

↓ 1 callersMethodaddEdge

(int u, int v)

src/chapter09graphs/GraphAdjacencyList.java:137

↓ 1 callersMethodaddEdge

(int u, int v)

src/chapter09graphs/DFS.java:52

↓ 1 callersMethodbuildBT

(int[] postOrder, int postStart, int postEnd, int[] inOrder, int inStart, int inEnd)

src/chapter06trees/TreeFromInOrderAndPostOrder.java:22

↓ 1 callersMethodbuildBT

(int[] preOrder, int preStart, int preEnd, int[] inOrder, int inStart, int inEnd)

src/chapter06trees/TreeFromInOrderAndPreOrder.java:21

↓ 1 callersMethodbuildHeap

( )

src/chapter07priorityqueues/BinaryHeap.java:85

↓ 1 callersMethodbuildHuffmanTree

()

src/chapter17greedyalgorithms/Huffman.java:70

↓ 1 callersMethodclearVisited

()

src/chapter09graphs/BFS.java:116

↓ 1 callersMethodclearVisited

()

src/chapter09graphs/DFS.java:116

next →1–100 of 490, ranked by callers