Commit e03875d

authored

Update tree-intro.asc

1 parent 03bafbb commit e03875dCopy full SHA for e03875d

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -106,6 +106,6 @@ image::image35.png[image,width=258,height=169]`
`106`	`106`
`107`	`107`	`.Heap vs. Binary Search Tree`
`108`	`108`	`****`
`109`		`-Heap is better at finding max or min values in constant time O(1), while a balanced BST is good a finding any element in O(log n). Heaps are often used to implement priority queues, while BST is used when you need every value sorted.`
	`109`	`+Heap is better at finding max or min values in constant time O(1), while a balanced BST is good at finding any element in O(log n). Heaps are often used to implement priority queues, while BST is used when you need every value sorted.`
`110`	`110`	`****`
`111`	`111`	`indexterm:[Runtime, Logarithmic]`

Comments

(0)