Binary Tree Data Structure
A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.
Binary Search Tree Data Structure
Binary Search Tree is a node-based binary tree data structure which has the following properties:
- The left subtree of a node contains only nodes with keys lesser than the node’s key.
- The right subtree of a node contains only nodes with keys greater than the node’s key.
- The left and right subtree each must also be a binary search tree.
- There must be no duplicate nodes.
Difference between Binary Tree and Binary Search Tree:
|BINARY TREE||BINARY SEARCH TREE|
|BINARY TREE is a non linear data structure where each node can have almost two child nodes||BINARY SEARCH TREE is a node based binary tree which further has right and left subtree that too are binary search tree.|
|BINARY TREE is unordered hence slower in process of insertion, deletion and searching.||Insertion, deletion, searching of an element is faster in BINARY SEARCH TREE than BINARY TREE due to the ordered characteristics|
|IN BINARY TREE there is no ordering in terms of how the nodes are arranged||IN BINARY SEARCH TREE the left subtree has elements less than the nodes element and the right subtree has elements greater than the nodes element.|
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Difference between Organic Search and Paid Search
- Difference between Vertical search and Horizontal search
- Binary Search Tree | Set 1 (Search and Insertion)
- Complexity of different operations in Binary tree, Binary Search Tree and AVL tree
- Binary Tree to Binary Search Tree Conversion
- Minimum swap required to convert binary tree to binary search tree
- Binary Tree to Binary Search Tree Conversion using STL set
- Convert a Binary Search Tree into a Skewed tree in increasing or decreasing order
- Count the Number of Binary Search Trees present in a Binary Tree
- Sum and Product of minimum and maximum element of Binary Search Tree
- Difference between Search Engine and Web Browser
- Difference between Informed and Uninformed Search in AI
- Difference Between Pay Per Click and Search Engine Optimization
- Difference between Crawling and Indexing in Search Engine Optimization (SEO)
- Difference between General tree and Binary tree
- Difference between Binary tree and B-tree
- Print nodes of a Binary Search Tree in Top Level Order and Reversed Bottom Level Order alternately
- Total number of possible Binary Search Trees and Binary Trees with n keys
- Find the node with minimum value in a Binary Search Tree
- Lowest Common Ancestor in a Binary Search Tree.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.