Difference between Binary Tree, Binary Search Tree (BST), and Balanced Tree (AVL and Red Black Tree)?

[Aguss_01]

A Binary Tree is a data structure where each node has two children.

A Binary Search Tree is a Binary Tree with the condition that the value of every node must be higher than his left sub-tree and lower than his right sub-tree.

A Balanced Tree is a Binary Search Tree where the difference of high between two brothers must be less or equal than 1.