Link to code:https://s3.us-east-1.amazonaws.com/learn-us-east-1-prod-fleet01-xythos/5b5739b6d55fd/2821825?response-content-disposition=inline%3B%20filename%2A%3DUTF-8%27%27tree.cpp&response-content-type=text%2Fx-c&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Date=20190126T211332Z&X-Amz-SignedHeaders=host&X-Amz-Expires=21599&X-Amz-Credential=AKIAIBGJ7RCS23L3LEJQ%2F20190126%2Fus-east-1%2Fs3%2Faws4_request&X-Amz-Signature=44fcfd4d3e8c35973e135849aba0ecf3543ebb2d887bffbffc74d200746db416

1. Implement insert() in tree.cpp and show the results of inserting 2, 1, 4, 5, 9, 3, 6, 7, 10, 12,11 into an empty Binary search tree