求二叉树中叶子结点的个数
生活随笔
收集整理的這篇文章主要介紹了
求二叉树中叶子结点的个数
小編覺得挺不錯的,現在分享給大家,幫大家做個參考.
#include<iostream>
#define N 63using namespace std;char str[] = "ab#d##c#e##";
int i = -1;typedef struct node
{struct node *leftChild;struct node *rightChild;char data;
}BiTreeNode, *BiTree;//生成一個結點
BiTreeNode *createNode(int i)
{BiTreeNode * q = new BiTreeNode;q->leftChild = NULL;q->rightChild = NULL;q->data = i;return q;
}BiTree createBiTree1()
{BiTreeNode *p[N] = {NULL};int i;for(i = 0; i < N; i++)p[i] = createNode(i + 1);// 把結點連接成樹for(i = 0; i < N/2; i++){p[i]->leftChild = p[i * 2 + 1];p[i]->rightChild = p[i * 2 + 2];}return p[0];
}void createBiTree2(BiTree &T)
{i++;char c;if(str[i] && '#' == (c = str[i]))T = NULL;else{T = new BiTreeNode;T->data = c;createBiTree2(T->leftChild);createBiTree2(T->rightChild);}
}int getLeafNode(BiTree T)
{if(NULL == T)return 0;if(NULL == T->leftChild && NULL == T->rightChild)return 1;return getLeafNode(T->leftChild) + getLeafNode(T->rightChild);
}int main()
{BiTree T1;T1 = createBiTree1();cout << getLeafNode(T1) << endl;BiTree T2;createBiTree2(T2);cout << getLeafNode(T2) << endl;return 0;
}
總結
以上是生活随笔為你收集整理的求二叉树中叶子结点的个数的全部內容，希望文章能夠幫你解決所遇到的問題。
