Compare the contrast between a binary and binary search tree.

Question

Asked: February 23, 20222022-02-23T12:08:11+05:30 2022-02-23T12:08:11+05:30In: Data Structure

You must login to add an answer.

Need An Account,

I'M ADMIN · Answer 1 · 2022-02-23T21:05:55+05:30

Binary Tree:

Tree where each node has up to two leaves, it’s a data structure.
It is a non-linear tree data structure where a node can have a maximum of 2 children.
Nodes with duplicate values are allowed.
Used to implement variations of Binary Tree like BST, Perfect Binary Tree, etc.
Time complexity is usually O(n)

Binary Search Tree:

Used for searching. It’s an algorithm for searching element.
It is ordered binary tree with each node can have a maximum of 2 children.
In BST, the left child’s data will always have a value less than the parent’s data and the right child’s data will always have the value greater than the parent’s data
Nodes with duplicate values are not allowed.
Used to implement variations of Balanced Binary Trees like AVL, Red-Black, etc.
Time complexity is usually O(n)