-1

I am trying to understand the Binary tree and referring to online material , and questions asked in SO.

I understood that:

Binary tree -> Tree in which each node can have at most 2 nodes.

Binary search tree -> Specialized form of Binary tree in which left node value < parent node and right node value > parent node

Do we have a thing called as Binary search ?

If Binary search tree is a data structure, why it has "search" in it? It gives a feeling as if it is an algorithm?

I am still not clear, can anyone help clear the doubts.

EDIT

This is not duplicate of the SO question appearing, it is about asking 'search' leading to misnomer.

Improve this question
2

1 Answer 1

Reset to default
1

There is a searching algorithm called Binary search which performs in O(log n). The Binary search tree is a data structure that seeks to facilitate searching (Binary search) since node values are ranked in this order: left < parent < right. However a binary search tree could be unbalanced which means that difference of height between left child and right child > 1. Enters more efficient (in terms of searching performance) binary search trees called Self-balancing binary search tree that automatically adjust its height following insertions and deletions.

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

1 Comment

Also note that the data for a Binary search must be organized (ascending order, descending order etc).

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.