二叉排序树的实现_折半查找方法的实现_c二叉树非递归中序遍历(8)

cout<<p->data<<"";//访问该结点

}

cout<<endl;

}

int_tmain(intargc,_TCHAR*argv[])

{

BSTreetree;

tree.CreateTree();

tree.PreOrderVisit();

tree.InOrderVisit();

tree.PostOrderVisit();

intitem=0;

cout<<"请输入要查找的结点值：";

cin>>item;

cout<<item<<"存在返回1，否则返回0.结果是："<<tree.FindNode(item)<<endl;

cout<<item<<"的双亲是：";

if(tree.GetParent(item))

{

cout<<tree.GetParent(item)->data<<endl;

}

else

{

cout<<"该结点为根结点，不存在双亲！"<<endl;

}

cout<<item<<"中序遍历序列中前驱结点值是："<<tree.GetInOrderPre(item)->data<<endl;

cout<<item<<"中序遍历序列中后继结点值是："<<tree.GetInOrderPost(item)->data<<endl;

tree.InsertNode(100);

tree.InsertNode(48);

tree.DeleteNode(50);

tree.DeleteNode(45);

tree.DeleteNode(55);

tree.InOrderVisit();

cout<<"二叉排序树中，最大值为："<<tree.MaxNode()<<endl;

cout<<"二叉排序树中，最小值为："<<tree.MinNode()<<endl;

system("pause");

return0;

}

本文来自电脑杂谈，转载请注明本文网址：
http://www.pc-fly.com/a/jisuanjixue/article-25453-8.html