Implement Binary Search Tree search, insert delete.

Latest Source Code:
Github: BinarySearchTree.java

Output:

 25 
    
   25       
  / \   
 /   \  
 20   30   
  \     
  23     
                
Search 23 : Node(23)
Search 100 : null
       20               
      / \       
     /   \      
    /     \     
   /       \    
   3       30       
  / \     / \   
 /   \   /   \  
 2   10   27   36   
        / \     
        26 28     
                                
After delete 20: 
       26               
      / \       
     /   \      
    /     \     
   /       \    
   3       30       
  / \     / \   
 /   \   /   \  
 2   10   27   36   
          \     
          28     
                                
After delete 27: 
   26       
  / \   
 /   \  
 3   30   
/ \ / \ 
2 10 28 36