Operations of BSTs: Insert
Adds an element x to the tree so that the binary search tree property continues to hold
The basic algorithm
- Like the search procedure above
- Insert x in place of NULL
- Use a “trailing pointer” to keep track of where you came from (like inserting into singly linked list)