本文整理汇总了C++中BSTree::Ascend方法的典型用法代码示例。如果您正苦于以下问题：C++ BSTree::Ascend方法的具体用法？C++ BSTree::Ascend怎么用？C++ BSTree::Ascend使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BSTree的用法示例。
在下文中一共展示了BSTree::Ascend方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: main
void main(void)
{
DataType q;
q.key = 1; q.ID = 'a';
y.Insert(q);
q.key = 6; q.ID = 'b';
y.Insert(q);
q.key = 4; q.ID = 'c';
y.Insert(q);
q.key = 8; q.ID = 'd';
y.Insert(q);
cout << "Elements in ascending order are" << endl;
y.Ascend();
DataType s;
y.Delete(4,s);
cout << "Delete of 4 succeeds " << endl;
cout << s.key << ' ' << s.ID << endl;
cout << "Elements in ascending order are" << endl;
y.Ascend();
y.Delete(8,s);
cout << "Delete of 8 succeeds " << endl;
cout << s.key << ' ' << s.ID << endl;
cout << "Elements in ascending order are" << endl;
y.Ascend();
y.Delete(6,s);
cout << "Delete of 6 succeeds " << endl;
cout << s.key << ' ' << s.ID << endl;
cout << "Elements in ascending order are" << endl;
y.Ascend();
try {y.Delete(6,s);}
catch (BadInput)
{cout << "Delete of 6 fails " << endl;}
cout << "Elements in ascending order are" << endl;
y.Ascend();
}