Skip to content

algorithm: find the middle of linked-list #1096

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 5 commits into from
Sep 10, 2022
Merged

algorithm: find the middle of linked-list #1096

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
e931a4c
Added Middle of linked-list implementation.
Sep 8, 2022
b0ddd37
Added Middle of LL function and tests
Sep 9, 2022
a70a317
Refactor: Added method in singly LL and its tests
Sep 9, 2022
fbce118
Refactor: Method name and inline test calls
Sep 9, 2022
fdeca6a
Use `!== null` instead of `!= null`
appgurueu Sep 9, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Refactor: Method name and inline test calls
  • Loading branch information
10kartik committed Sep 9, 2022
commit fbce118f785773393598b991dc9c9a3d987735a9
4 changes: 2 additions & 2 deletions Data-Structures/Linked-List/SinglyLinkedList.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@
* a singly linked list.
*/

// Methods - size, head, addLast, addFirst, addAt, removeFirst, removeLast, remove, removeAt, indexOf, isEmpty, elementAt, get, clean
// Methods - size, head, addLast, addFirst, addAt, removeFirst, removeLast, remove, removeAt, indexOf, isEmpty, elementAt, findMiddle, get, clean

class Node {
constructor (data) {
Expand Down Expand Up @@ -194,7 +194,7 @@ class LinkedList {
}

// Returns a reference to middle node of linked list
MiddleOfLL () {
findMiddle () {
// If there are two middle nodes, return the second middle node.
let fast = this.headNode
let slow = this.headNode
Expand Down
9 changes: 3 additions & 6 deletions Data-Structures/Linked-List/test/SinglyLinkedList.test.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -168,9 +168,8 @@ describe('SinglyLinkedList', () => {
const list = new LinkedList()
list.addFirst(1)

let MiddleNodeOfLinkedList = list.MiddleOfLL(list.headNode)
// Middle node for list having single node
expect(MiddleNodeOfLinkedList.data).toEqual(1)
expect(list.findMiddle().data).toEqual(1)

list.addLast(2)
list.addLast(3)
Expand All @@ -179,15 +178,13 @@ describe('SinglyLinkedList', () => {
list.addLast(6)
list.addLast(7)

MiddleNodeOfLinkedList = list.MiddleOfLL(list.headNode)
// Middle node for list having odd number of nodes
expect(MiddleNodeOfLinkedList.data).toEqual(4)
expect(list.findMiddle().data).toEqual(4)

list.addLast(10)

MiddleNodeOfLinkedList = list.MiddleOfLL(list.headNode)
// Middle node for list having even number of nodes
expect(MiddleNodeOfLinkedList.data).toEqual(5)
expect(list.findMiddle().data).toEqual(5)
})

it('Check Iterator', () => {
Expand Down