Tim Duong Di Tu Goc Toi Nut Co Gia Tri Lon Nhat CNP
//
//
#include "stdafx.h"
#include <stdio.h>
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
typedef int element_type;
typedef struct node
{
element_type element;
struct node *left, *right;
} NODE;
NODE *root;
void khoi_tao_cay(NODE ** root)
{
*root = NULL;
}
void insert(NODE *tmp, NODE **root)
{
if (tmp->element < (*root)->element)
if ((*root)->left)
insert(tmp, &(*root)->left);
else
(*root)->left = tmp;
else
if ((*root)->right)
insert(tmp, &(*root)->right);
else
(*root)->right = tmp;
}
void insert_node(element_type e, NODE **root)
{
NODE *tmp;
tmp = (NODE *)malloc(sizeof(NODE));
tmp->element = e;
tmp->left = NULL;
tmp->right = NULL;
if (*root == NULL)
*root = tmp;
else
insert(tmp, root);
}
void nhap_cay(NODE **root)
{
element_type e;
printf("\n NHAP CAY NHI PHAN ! \n");
printf("\n Nhap -1 de ket thuc !\n ");
int i=1;
do {
printf("\n Nhap phan tu thu %d :",i);
scanf("%d", &e);
if (e != -1)
insert_node(e, root);
i++;
} while (e != -1);
}
int gia_tri_nut_max(NODE *root)
{
int max=root->element;
while (root->right!=NULL)
{
root=root->right;
max=root->element;
}
return max;
}
char Search(NODE *root,int x)
{
NODE *temp = root;
while (temp != NULL ) {
if (temp -> element == x)
return 1;
else
{
if (temp -> element > x)
temp = temp -> left;
else
temp = temp -> right;
}
}
return 0;
}
char Search(NODE *root,int x) ;
void duong_di_tu_goc(NODE *root, int x)
{
if (Search(root,x))
{
while (root->element!=x)
{
printf(" %d -> ", root->element);
if (root->element>x)
root=root->left;
else
if (root->element<x)
root=root->right;
}
printf(" %d -> ",root->element);
}
else
return ;
}
void main()
{
khoi_tao_cay(&root);
nhap_cay(&root);
printf("\n Nut co gia tri lon nhat trong cay :%d ", gia_tri_nut_max(root));
int x=gia_tri_nut_max(root);
printf("\n Duong di tu nut goc den nut co gia tri lon nhat:");
duong_di_tu_goc(root, x);
getch();
}
0 nhận xét:
Đăng nhận xét