Question

Compare Binary Tree and Binary Search Tree.

Answer 1

Binary tree	Binary Search Tree
It is a form of tree which represents hierarchical data in a tree structure .	It is a type of binary tree which keeps the keys in a sorted order for fast lookup.
Each parent node can have maximum two child nodes.	In binary search tree , left child contains only nodes with value less than or equal to the parent node , and right child only contains nodes with values greater than the parent node.
It don't have a specific order to arrange the data elements .	It has a specific order to arrange the data elements.
Types of Binary tree : Full Binary Tree , Complete Binary Tree , Extended Binary tree and Perfect Binary tree.	Types of binary search tree : T - tree , AVL tree , Red - black tree etc.
It is used for fast and efficient lookup of data and information in a tree structure.	It is mainly used for insertion , deletion and searching of elements.

Comments

Useful and nicely compared