In C++:
Write animplementation of the set class, with associated iterators using a binarysearch tree.
Add to each node alink to the next smallest and next largest node.
Note: To make the code simpler, add a header and tail node whichare not part of the binary search tree but help make the linked list part ofthe code simpler.
