Implement simple binary tree data structure with following operations,  (assume data elements)
InsertLeft 
InsertRight 
RemoveLeft 
RemoveRight 
Traverse (pre-order, in-order and post-order) 

Leave a Reply

Your email address will not be published. Required fields are marked *