MCPcopy Create free account

hub / github.com/Deepali-Srivastava/data-structures-and-algorithms-in-java / functions

Functions382 in github.com/Deepali-Srivastava/data-structures-and-algorithms-in-java

⨍ Functions 382◇ Types & classes 95
↓ 12 callersMethoddisplayList
()
linked-list/singleLinkedList/SingleLinkedList.java:20
↓ 7 callersMethodgetstudentId
()
hashing/OpenAddressing1/studentRecord.java:19
↓ 7 callersMethodpush
(int x)
stack/postfix/StackInt.java:41
↓ 6 callersMethodgetstudentId
()
hashing/OpenAddressing/studentRecord.java:18
↓ 5 callersMethodcreateList
()
linked-list/singleLinkedList/SingleLinkedList.java:100
↓ 5 callersMethodisEmpty
()
Tree/binaryTree/QueueA.java:28
↓ 5 callersMethodisEmpty
()
stack/parentheses/StackA.java:31
↓ 5 callersMethodisEmpty
()
stack/postfix/StackChar.java:31
↓ 5 callersMethodisEmpty
()
queue/queueCircularLinked/QueueCL.java:19
↓ 4 callersMethoddisplayList
()
linked-list/circularLinkedList/CircularLinkedList.java:17
↓ 4 callersMethodgetstudentId
()
hashing/SeparateChaining/studentRecord.java:18
↓ 4 callersMethodisEmpty
()
Tree/binarySearchTree/BinarySearchTree.java:19
↓ 4 callersMethodisEmpty
()
queue/queueArray/QueueA.java:28
↓ 4 callersMethodisEmpty
()
queue/circularQueue/CircularQueue.java:27
↓ 4 callersMethodisEmpty
()
sorting/bianry-tree-sort/BinarySearchTree.java:34
↓ 3 callersMethodBubbleSortExData
()
linked-list/singleLinkedList/SingleLinkedList.java:292
↓ 3 callersMethodconvertBase
(int n,int base)
recursion/BaseConversion.java:20
↓ 3 callersMethodcreateList
()
linked-list/circularLinkedList/CircularLinkedList.java:57
↓ 3 callersMethodhash
(int key)
hashing/OpenAddressing/HashTable.java:26
↓ 3 callersMethodhash
(int key)
hashing/OpenAddressing1/HashTable.java:110
↓ 3 callersMethodhash
(int key)
hashing/SeparateChaining/HashTable.java:25
↓ 3 callersMethodinsert
(Node x)
Tree/binaryTree/QueueA.java:46
↓ 3 callersMethodisEmpty
()
stack/stackLinked/StackL.java:61
↓ 3 callersMethodisEmpty
()
stack/stackArray/StackA.java:32
↓ 3 callersMethodisEmpty
()
stack/postfix/StackInt.java:31
↓ 3 callersMethodisEmpty
()
queue/queueLinked/QueueL.java:67
↓ 3 callersMethodisEmpty
()
queue/priorityQueue/PriorityQueueL.java:57
↓ 3 callersMethodisEmpty
()
queue/deque/DequeA.java:113
↓ 3 callersMethodpop
()
stack/postfix/StackChar.java:52
↓ 3 callersMethodpop
()
stack/postfix/StackInt.java:52
↓ 2 callersMethodInsert
(studentRecord newRecord)
hashing/OpenAddressing1/HashTable.java:65
↓ 2 callersMethoddisplay
()
Tree/binarySearchTree/BinarySearchTree.java:242
↓ 2 callersMethodfindCycle
()
linked-list/singleLinkedList/SingleLinkedList.java:481
↓ 2 callersMethodheight
()
Tree/binarySearchTree/BinarySearchTree.java:308
↓ 2 callersMethodinorder
()
Tree/binarySearchTree/BinarySearchTree.java:278
↓ 2 callersMethodinsertAtEnd
(int data)
linked-list/HeaderList/HeaderList.java:36
↓ 2 callersMethodinsertAtEnd
(int data)
linked-list/circularLinkedList/CircularLinkedList.java:49
↓ 2 callersMethodinsertAtEnd
(int data)
linked-list/doubleLinkedList/DoubleLinkedList.java:50
↓ 2 callersMethodinsertAtEnd
(int data)
linked-list/singleLinkedList/SingleLinkedList.java:82
↓ 2 callersMethodinsertInEmptyList
(int data)
linked-list/circularLinkedList/CircularLinkedList.java:42
↓ 2 callersMethodinsertInEmptyList
(int data)
linked-list/doubleLinkedList/DoubleLinkedList.java:44
↓ 2 callersMethodinsertInOrder
(int data)
linked-list/sortedLinkedList/SortedLinkedList.java:18
↓ 2 callersMethodinsertInOrder
(int data)
sorting/address-calculation-sort/SortedLinkedList.java:16
↓ 2 callersMethodisFull
()
queue/circularQueue/CircularQueue.java:31
↓ 2 callersMethodisFull
()
queue/deque/DequeA.java:108
↓ 2 callersMethodmerge2
(SingleLinkedList list)
linked-list/singleLinkedList/SingleLinkedList.java:393
↓ 2 callersMethodnextPrime
(int x)
hashing/OpenAddressing1/HashTable.java:127
↓ 2 callersMethodpostorder
()
Tree/binarySearchTree/BinarySearchTree.java:293
↓ 2 callersMethodprecedence
(char symbol)
stack/postfix/Demo.java:72
↓ 2 callersMethodpreorder
()
Tree/binarySearchTree/BinarySearchTree.java:263
↓ 2 callersMethodpush
(char x)
stack/postfix/StackChar.java:41
↓ 2 callersMethodrehash
(int newSize)
hashing/OpenAddressing1/HashTable.java:115
↓ 2 callersMethodrestoreDown
(int i, int[] a, int n)
sorting/HeapSort.java:34
↓ 1 callersMethodBubbleSortExLinks
()
linked-list/singleLinkedList/SingleLinkedList.java:311
↓ 1 callersMethodDelete
()
Tree/binaryTree/QueueA.java:59
↓ 1 callersMethodDelete
()
queue/queueArray/QueueA.java:59
↓ 1 callersMethodDelete
()
queue/queueLinked/QueueL.java:44
↓ 1 callersMethodDelete
()
queue/circularQueue/CircularQueue.java:52
↓ 1 callersMethodDelete
()
queue/priorityQueue/PriorityQueueL.java:41
↓ 1 callersMethodDelete
()
queue/queueCircularLinked/QueueCL.java:41
↓ 1 callersMethodDelete
(int key)
hashing/OpenAddressing/HashTable.java:85
↓ 1 callersMethodDelete
(int key)
hashing/OpenAddressing1/HashTable.java:87
↓ 1 callersMethodDelete
(int key)
hashing/SeparateChaining/HashTable.java:66
↓ 1 callersMethodDisplayTable
()
hashing/OpenAddressing/HashTable.java:71
↓ 1 callersMethodDisplayTable
()
hashing/OpenAddressing1/HashTable.java:26
↓ 1 callersMethodDisplayTable
()
hashing/SeparateChaining/HashTable.java:30
↓ 1 callersMethodGCD
(int a, int b)
recursion/Euclids.java:12
↓ 1 callersMethodInsert
(studentRecord newRecord)
hashing/OpenAddressing/HashTable.java:31
↓ 1 callersMethodInsert
(studentRecord newRecord)
hashing/SeparateChaining/HashTable.java:54
↓ 1 callersMethodInsert1
(studentRecord newRecord)
hashing/OpenAddressing1/HashTable.java:55
↓ 1 callersMethodSearch
(int key)
hashing/OpenAddressing/HashTable.java:55
↓ 1 callersMethodSearch
(int key)
hashing/OpenAddressing1/HashTable.java:39
↓ 1 callersMethodSearch
(int key)
hashing/SeparateChaining/HashTable.java:44
↓ 1 callersMethodbuildHeap_BottomUp
(int[] a, int n)
Tree/heap/Demo1.java:16
↓ 1 callersMethodbuildHeap_BottomUp
(int[] arr, int n)
sorting/HeapSort.java:27
↓ 1 callersMethodbuildHeap_TopDown
(int[] a, int n)
Tree/heap/Demo1.java:10
↓ 1 callersMethodconcatenate
(CircularLinkedList list)
linked-list/circularLinkedList/CircularLinkedList.java:165
↓ 1 callersMethodconcatenate
(SingleLinkedList list)
linked-list/singleLinkedList/SingleLinkedList.java:274
↓ 1 callersMethodcopy
(int[] a, int[] temp, int low, int up)
sorting/MergeSortRecursive.java:58
↓ 1 callersMethodcopy
(int a[], int temp[], int n)
sorting/MergeSortIterative.java:72
↓ 1 callersMethodcountNodes
()
linked-list/singleLinkedList/SingleLinkedList.java:38
↓ 1 callersMethodcreateList
()
linked-list/HeaderList/HeaderList.java:48
↓ 1 callersMethodcreateList
()
linked-list/doubleLinkedList/DoubleLinkedList.java:61
↓ 1 callersMethodcreateList
()
linked-list/sortedLinkedList/SortedLinkedList.java:38
↓ 1 callersMethodcreateTree
()
Tree/binaryTree/BinaryTree.java:127
↓ 1 callersMethoddelete
(int x)
Tree/binarySearchTree/BinarySearchTree.java:100
↓ 1 callersMethoddelete1
(int x)
Tree/binarySearchTree/BinarySearchTree.java:141
↓ 1 callersMethoddeleteFirstNode
()
linked-list/circularLinkedList/CircularLinkedList.java:102
↓ 1 callersMethoddeleteFirstNode
()
linked-list/doubleLinkedList/DoubleLinkedList.java:144
↓ 1 callersMethoddeleteFirstNode
()
linked-list/singleLinkedList/SingleLinkedList.java:207
↓ 1 callersMethoddeleteFront
()
queue/deque/DequeA.java:64
↓ 1 callersMethoddeleteLastNode
()
linked-list/circularLinkedList/CircularLinkedList.java:114
↓ 1 callersMethoddeleteLastNode
()
linked-list/doubleLinkedList/DoubleLinkedList.java:157
↓ 1 callersMethoddeleteLastNode
()
linked-list/singleLinkedList/SingleLinkedList.java:214
↓ 1 callersMethoddeleteNode
(int data)
linked-list/HeaderList/HeaderList.java:106
↓ 1 callersMethoddeleteNode
(int x)
linked-list/circularLinkedList/CircularLinkedList.java:130
↓ 1 callersMethoddeleteNode
(int x)
linked-list/doubleLinkedList/DoubleLinkedList.java:172
↓ 1 callersMethoddeleteNode
(int x)
linked-list/singleLinkedList/SingleLinkedList.java:231
↓ 1 callersMethoddeleteNode
(int x)
hashing/SeparateChaining/SingleLinkedList.java:60
↓ 1 callersMethoddeleteRear
()
queue/deque/DequeA.java:86
next →1–100 of 382, ranked by callers