Data Structures 189 views

Repod

Share

0

More

Main Differences

Binary Tree is a special type of tree which have only three possibilities for nodes. i.e.

Zero Node

One Node

Two Nodes

In this there is not differentiation on values of nodes

Binary Search Tree on the other hand is a special type of Binary Tree which follows the number of nodes rule i.e.

Zero Node

One Node

Two Nodes

But in addition to the above rules, it follows one more rule i.e.

left child node is smaller than its parent Node

right child node is greater than its parent Node

Image representation

Signin to comment

No comments yet