?? 6.42.cpp
字號(hào):
//從鍵盤讀入一組數(shù)據(jù),根據(jù)輸入的數(shù)據(jù)創(chuàng)建一個(gè)二叉樹,數(shù)據(jù)的插入按
//照每個(gè)節(jié)點(diǎn)的左節(jié)點(diǎn)小于等于該節(jié)點(diǎn),右節(jié)點(diǎn)大于該節(jié)點(diǎn)的規(guī)則。
#include <stdio.h>
#include <stdlib.h>
#define Maxsize 10
struct TNode
{
int data;
struct TNode * left;
struct TNode * right;
};
typedef struct TNode *Tree;
int n,c=0,k;
int count;
void Insert(Tree *t, int value)
{
struct TNode *tmp;
Tree T =*t;
if(T == NULL)
{
tmp =(struct TNode *)malloc(sizeof(struct TNode));
tmp->data = value;
tmp->left = NULL;
tmp->right = NULL;
*t = tmp;
}
else
{
if( value <= T->data)
{
if(T->left != NULL)
Insert(&(T->left), value);
else
{
tmp =(struct TNode *)malloc(sizeof(struct TNode));
tmp->data = value;
tmp->left = NULL;
tmp->right = NULL;
(*t)->left = tmp;
}
}
else
{
if(T->right != NULL)
Insert(&(T->right), value);
else
{
tmp =(struct TNode *)malloc(sizeof(struct TNode));
tmp->data = value;
tmp->left = NULL;
tmp->right = NULL;
(*t)->right = tmp;
}
}
}
}
void CountTrees(Tree T)
{
if(T == NULL)
return;
else
{ if(T->left==NULL && T->right==NULL)
count++;
else
{
CountTrees(T->left);
CountTrees(T->right);
}
}
}
void main()
{
Tree T;
int i,a;
T=NULL;
printf("How many nodes?\n");
scanf("%d",&n);
for(i=0; i<n; i++)
{
scanf("%d",&a);
Insert(&T,a);
}
printf("\n");
CountTrees(T);
printf("樹葉的數(shù)目為:%d",count);
printf("\n");
}
?? 快捷鍵說(shuō)明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號(hào)
Ctrl + =
減小字號(hào)
Ctrl + -