Commit2a3b013

committed

Add data-structure complexity table.

1 parent7bd7f9a commit2a3b013Copy full SHA for 2a3b013

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -206,7 +206,7 @@ Below is the list of some of the most used Big O notations and their performance`
`206`	`206`	`\|Queue\| n\| n\| 1\| 1\|\|`
`207`	`207`	`\|Linked List\| n\| n\| 1\| 1\|\|`
`208`	`208`	`\|Hash Table\| -\| n\| n\| n\| In case of perfect hash function costs would be O(1)\|`
`209`		`-\|Binary Search Tree\| n\| n\| n\| n\|\|`
	`209`	`+\|Binary Search Tree\| n\| n\| n\| n\|In case of balanced tree costs would be O(log(n))\|`
`210`	`210`	`\|B-Tree\| log(n)\| log(n)\| log(n)\| log(n)\|\|`
`211`	`211`	`\|Red-Black Tree\| log(n)\| log(n)\| log(n)\| log(n)\|\|`
`212`	`212`	`\|AVL Tree\| log(n)\| log(n)\| log(n)\| log(n)\|\|`

Comments

(0)