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