Can anyone please explain the difference between binary tree and binary search tree with an example?
Difference between binary tree and binary search tree
binary treebinary-search-treedata structurestree
Related Topic
- The difference between tree depth and height
- Java – How to implement a tree data-structure in Java
- Sql – What are the options for storing hierarchical data in a relational database
- Heap vs Binary Search Tree (BST)
- What’s the difference between the data structure Tree and Graph
- Ukkonen’s suffix tree algorithm in plain English
- Difference between “Complete binary tree”, “strict binary tree”,”full binary Tree”
- Difference between binary search and binary search tree
Best Answer
Binary tree: Tree where each node has up to two leaves
Binary search tree: Used for searching. A binary tree where the left child contains only nodes with values less than the parent node, and where the right child only contains nodes with values greater than or equal to the parent.