It's not at all important to get it right the first time. It's vitally important to get it right the last time. Andrew Hunt and David Thomas
Write a program to check the given binary search tree internal node has exactly node child or not.
All Binary Tree Values: 1 2 3 4 The internal node has exactly one node