int main() { RBTree<int, int> rb; int a[] = { 16, 3, 7, 11, 9, 26, 18, 14, 15 }; for (int i = 0; i < sizeof(a) / sizeof(a[0]); i++) { rb.Insert(a[i], a[i]); } rb.InOrder(); cout<<rb.IsBalanceTree(); return 0; }
void TestRBTree() { int array[] = { 4, 5, 13, 28, 5, 19, 18, 37, 10, 20 }; RBTree<int, int> t; for (size_t i = 0; i < 10; ++i) { t.Insert(array[i], array[i]); } t.InOrder(); cout << endl; cout << "IsBlance?" << " " << t.IsBlance() << endl; }
void Test() { RBTree<int,int> rbt; //int arr[] = {16,3,7,11,9,26,18,14,15}; int arr[] = {48,12,56,32,99,11,10,78,22}; int size = sizeof(arr)/sizeof(arr[0]); for (int i = 0;i < size;i++) { rbt.Insert(arr[i],i); cout<<"IsBlance? "<<rbt.IsBlance()<<endl; } rbt.InOrder(); cout<<"IsBlance? "<<rbt.IsBlance()<<endl; }