Commit2371dd2

committed

Update LinkedList time complexity for deletion.

1 parenta1d218d commit2371dd2Copy full SHA for 2371dd2

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -279,7 +279,7 @@ Below is the list of some of the most used Big O notations and their performance`
`279`	`279`	`\|Array\| 1\| n\| n\| n\|\|`
`280`	`280`	`\|Stack\| n\| n\| 1\| 1\|\|`
`281`	`281`	`\|Queue\| n\| n\| 1\| 1\|\|`
`282`		`-\|Linked List\| n\| n\| 1\|1\|\|`
	`282`	`+\|Linked List\| n\| n\| 1\|n\|\|`
`283`	`283`	`\|Hash Table\| -\| n\| n\| n\| In case of perfect hash function costs would be O(1)\|`
`284`	`284`	`\|Binary Search Tree\| n\| n\| n\| n\| In case of balanced tree costs would be O(log(n))\|`
`285`	`285`	`\|B-Tree\| log(n)\| log(n)\| log(n)\| log(n)\|\|`

Comments

(0)