12.红黑树set

 #include <iostream>
 //红黑树(自动保证平衡,自动生成平衡查找树)
 #include <set>
 #include <cstring>
 #include <cstdlib>
 using namespace std;

 //红黑树增删查改
 void main1()
 {
     set<int> myset{ ,,,, };
     myset.insert();
     myset.insert();
     //重复的数据会被忽略
     myset.insert();

     //中序遍历
     for (auto i : myset)
     {
         cout << i << endl;
     }

     //正向迭代
     for (auto ib = myset.begin(), ie = myset.end(); ib != ie; ib++)
     {
         cout << *ib << endl;
     }

     //反向迭代
     for (auto rb = myset.rbegin(), re = myset.rend(); rb != re; rb++)
     {
         cout << *rb << endl;
     }

     auto it = myset.find();
     if (it != myset.end())
     {
         cout << "find" << *it << endl;
         //不能修改
         //*it = 9;
         //删除
         myset.erase(it);
         //或者
         //myset.erase(10);
     }
     else
     {
         cout << "not find" << *it << endl;
     }

     //元素个数
     myset.size();
     //清空
     myset.empty();
     cin.get();
 }

 struct strless
 {
     bool operator()(const char *str1, const char *str2)
     {
         return (strcmp(str1, str2) < );
     }
 };

 void main()
 {
     const char *p[] = { "calc","notepad","run","go" ,""};
     //设置比较函数 前边是类型,后边是比较的函数
     set<const char *, strless> myset(p, p + , strless());
     myset.insert("");

     for (auto i : myset)
     {
         cout << i << endl;
     }
     cin.get();
 }