当前位置: 首页>>代码示例>>C++>>正文


C++ AVL::LeftRotateAbout方法代码示例

本文整理汇总了C++中AVL::LeftRotateAbout方法的典型用法代码示例。如果您正苦于以下问题:C++ AVL::LeftRotateAbout方法的具体用法?C++ AVL::LeftRotateAbout怎么用?C++ AVL::LeftRotateAbout使用的例子?那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在AVL的用法示例。


在下文中一共展示了AVL::LeftRotateAbout方法的1个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。

示例1:

main(){

	int length = 6;
	int a[6] = {1,2,3,4,5,6};
	AVL tree;
	tree.Binarify(a,length);
	cout<<"============================================================="<<endl<<endl;
	cout<<"Displaying the Binary Sorted tree :- "<<endl;
	tree.DisplayTree();
	cout<<"============================================================="<<endl<<endl;
	cout<<"Heights of nodes in the AVL: "<<endl;
	tree.DisplayTreeWithHeights();
	cout<<"Size of Binary Tree = "<<(tree.head)->size<<endl;
	cout<<"============================================================="<<endl<<endl;
	cout<<"Displaying Tree with Heights after Rotating about 4"<<endl;
	tree.LeftRotateAbout(tree.find(1));
	tree.DisplayTreeWithHeights();
	cout<<"Size of Binary Tree = "<<(tree.head)->size<<endl;
	cout<<"============================================================="<<endl<<endl;
	cout<<"Displaying Tree with Heights after again Rotating about 4"<<endl;
	tree.LeftRotateAbout(tree.find(2));
	tree.DisplayTreeWithHeights();
	cout<<"Size of Binary Tree = "<<(tree.head)->size<<endl;
	cout<<"============================================================="<<endl<<endl;
	cout<<"Displaying Tree with Heights after again Rotating about 2"<<endl;
	tree.LeftRotateAbout(tree.find(4));
	tree.DisplayTreeWithHeights();
	cout<<"Size of Binary Tree = "<<(tree.head)->size<<endl;
	cout<<"============================================================="<<endl<<endl;
	cout<<"Size of Binary Tree = "<<(tree.head)->size<<endl;
	cout<<"============================================================="<<endl<<endl;
	cout<<"Finding if 13 is a member of tree :- "<<tree.find(13)<<endl;
	cout<<"Finding if 2 is a member of tree :- "<<tree.find(2)<<endl;
	cout<<"============================================================="<<endl<<endl;
	cout<<"Finding number of nodes less than 9 :-  "<<tree.NodesLessThan(9)<<endl;
	cout<<"============================================================="<<endl<<endl;
}
开发者ID:ravikishore1993,项目名称:Algorithms,代码行数:37,代码来源:AVL.cpp


注:本文中的AVL::LeftRotateAbout方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。