Commitb1f31cd

committed

1 parentbdf8a17 commitb1f31cdCopy full SHA for b1f31cd

File tree

+23

-1

lines changed

+23

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -175,7 +175,7 @@ export default class Heap {`
`175`	`175`	`leftChild!==null`
`176`	`176`	`&&(`
`177`	`177`	`parentItem===null`
`178`		`-\|\|!this.pairIsInCorrectOrder(parentItem,this.heapContainer[indexToRemove])`
	`178`	`+\|\|this.pairIsInCorrectOrder(parentItem,this.heapContainer[indexToRemove])`
`179`	`179`	`)`
`180`	`180`	`){`
`181`	`181`	`this.heapifyDown(indexToRemove);`

Lines changed: 22 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -169,4 +169,26 @@ describe('MinHeap', () => {`
`169`	`169`	`minHeap.remove('hey',comparator);`
`170`	`170`	`expect(minHeap.toString()).toBe('a,bb,dddd');`
`171`	`171`	`});`
	`172`	`+`
	`173`	`+it('should remove values from heap and correctly re-order the tree',()=>{`
	`174`	`+constminHeap=newMinHeap();`
	`175`	`+`
	`176`	`+minHeap.add(1);`
	`177`	`+minHeap.add(2);`
	`178`	`+minHeap.add(3);`
	`179`	`+minHeap.add(4);`
	`180`	`+minHeap.add(5);`
	`181`	`+minHeap.add(6);`
	`182`	`+minHeap.add(7);`
	`183`	`+minHeap.add(8);`
	`184`	`+minHeap.add(9);`
	`185`	`+`
	`186`	`+expect(minHeap.toString()).toBe('1,2,3,4,5,6,7,8,9');`
	`187`	`+`
	`188`	`+minHeap.remove(2);`
	`189`	`+expect(minHeap.toString()).toBe('1,4,3,8,5,6,7,9');`
	`190`	`+`
	`191`	`+minHeap.remove(4);`
	`192`	`+expect(minHeap.toString()).toBe('1,5,3,8,9,6,7');`
	`193`	`+});`
`172`	`194`	`});`

Comments

(0)