本文整理汇总了C++中BSTree::deletion方法的典型用法代码示例。如果您正苦于以下问题：C++ BSTree::deletion方法的具体用法？C++ BSTree::deletion怎么用？C++ BSTree::deletion使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BSTree的用法示例。
在下文中一共展示了BSTree::deletion方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: main
int main()
{
int N=0;
cin>>N;
char ins[20];
int a,b;
BSTree tree;
for(int i=0;i<N;i++)
{
cin>>ins;
if(ins[0]=='i')
{
cin>>a;
tree.insertData(a);
//tree.printByInOrderTraversal();
}
if(ins[0]=='d')
{
if(ins[6]=='\0')
{
cin>>a;
tree.deletion(a);
//tree.printByInOrderTraversal();
}
else
{
if(ins[7]=='l')示例2: main
int main() {
BSTree mytree;
mytree.insertion(12);
mytree.insertion(10);
mytree.insertion(20);
mytree.insertion(9);
mytree.insertion(11);
mytree.insertion(10);
mytree.insertion(12);
mytree.insertion(12);
mytree.getMaxDepth();
mytree.getLCA(9, 20);
mytree.getAncestors(9);
mytree.printOrder();
mytree.deletion(20);
mytree.getMaxDepth();
mytree.getLCA(9, 11);
mytree.getAncestors(9);
mytree.printOrder();
mytree.deletion(12);
mytree.getMaxDepth();
mytree.getLCA(9, 12);
mytree.getAncestors(9);
mytree.printOrder();
mytree.deletion(9);
mytree.getMaxDepth();
mytree.getLCA(10, 11);
mytree.getAncestors(12);
mytree.printOrder();
return 0;
}