Question

c++

What are the differences and similarities between Binary Search Tree and Binary Searches of arrays.

Answer 1

Differences -

BinarySearch Tree	Binary search
Its work on tree data structure	It work on array data structure
In this data is arrange in such a way that data on left side of node is smaller and on right side is larger	In this data is arranged in sorted form the array ie sorting form
Used to handle large amount of data	Cant be used to handle large amount of data
Uses pointers to store the data in memory at particular location	It doesnt uses pointer

Similarity -

Binary Search Tree	Binary Search
Time complexity is O(Log(n))	Time complexity is O(Log(n))
Uses same technique of storing data in sorted form	Here also data is stored in sorted form.