Difference between Binary search and Binary search tree

Question

Can anyone explain the difference between binary search and binary search tree with example?Are they the same?Reading the internet it seems the second is only for trees and binary search does not follow this rule.And how to check the presence of a number in O(log(n)) time?

Possible duplicate - stackoverflow.com/questions/6380231/… — stud3nt
– stud3nt, Commented Nov 30, 2019 at 12:15
Does this answer your question? Difference between binary tree and binary search tree — stud3nt
– stud3nt, Commented Nov 30, 2019 at 12:16
Don't confuse yourself.Binary search is a searching algorithm. However BST is a tree data structure which provides efficient searching. — Nawnit Sen
– Nawnit Sen, Commented Nov 30, 2019 at 14:39

Ari Fordsham · Accepted Answer · 2019-12-01 14:42:16Z

1

Binary search is an algorithm used on straightforward sorted arrays, which runs in O(log n). Updating a sorted array is O(n).

A binary tree is a data structure that has both O(log n) search and update (Ignoring problems of balancing).

An interesting comparison is at the end of this chapter.

answered Dec 1, 2019 at 14:42

Ari Fordsham

2,52410 silver badges31 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Difference between Binary search and Binary search tree

1 Answer 1

Comments

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Linked

Related