glShadeModel(GL_SMOOTH);
glPolygonMode(GL_FRONT_AND_BACK,GL_FILL);
glBegin(GL_TRIANGLE_FAN);
glVertex3f(0.0f,0.0f,0.0f);
glVertex3f(0.16f,-.05f,0.0f);
glVertex3f(0.2f,-0.05f,0.0f);
glVertex3f(0.1f,0.0f,0.0f);
glVertex3f(0.2f,0.05f,0.0f);
glVertex3f(0.1f,0.06f,0.0f);
glVertex3f(0.16f,0.08f,0.0f);
2022-01-02 11:58:16
48KB
1
二叉树是树形结构的一种重要类型。本算法是数据结构实验课上的一次实验，在熟悉二叉树结点的结构， 掌握二叉树的基本操作以及具体实现后，利用递归方法编写对二叉树这种递归数据结构进行处理的算法。
2021-12-15 19:57:44
864B
1
本文实例讲述了C++使用递归和非递归算法实现的二叉树叶子节点个数计算方法。分享给大家供大家参考，具体如下：
/*求二叉树叶子节点个数 -- 采用递归和非递归方法
经调试可运行源码及分析如下：
***/
#include
#include
#include
using std::cout;
using std::cin;
using std::endl;
using std::stack;
/*二叉树结点定义*/
typedef struct BTreeNode
{
char elem;
struct BTreeNode *p
2021-11-25 09:03:55
41KB
1