What is the difference between a binary tree and a binary search tree?

Binary Tree - the Binary tree is a data structure in which every node have at most 2 children (i.e either 0 children, 1 child or 2 children).
More details[1]
Binary Search Tree - It is an application of Binary Tree, in which we search element in the Binary tree. Binary search tree is different from a binary tree.
In Binary Search Tree value of a left child is less than root node and value of a right child is greater than or equal to the value of root node.
Footnotes

Comments

Popular posts from this blog

What is the difference between Data Science, Big Data, Data Mining and Machine Learning?

What is the difference between spooling, buffering and caching in OS?

About Me