Insertion in Binary Search Tree vs Insertion in Binary Tree
What is the difference between insertion in Binary Search Tree(BST) and in Binary Tree(BT)? I know in BST, you compare the value of the new node with root, if smaller, you added to its left, if big...