Question

Binary trees - C programming;

Write a program in C, you must have as input a .txt file (start.txt), and have as output answering questions about the tree. Edges as pairs (x, y), x and y refer to the names of the nodes
Input (start.txt):
(1,2)
(1,3)
(2,4)
(2,5)
(3,6)
(3,7)
(4,8)

Output(output.txt):

Is the tree complete? NO
What is the weight of the tree? 4
Is it balanced? YES

Answer 1

#include <stdio.h>
#include <stdlib.h>
#define TRUE 1
#define FALSE 0

struct node
{
int value;
struct node *right;
struct node *left;
}mynode;

int max(int a, int b)
{
return (a >= b) ? a : b;
}

struct node* newNode(int data)
{
struct node* node = (struct node*)
malloc(sizeof(struct node));
node->value = data;
node->left = NULL;
node->right = NULL;

return (node);
}

void putNode(struct node* node, int data1, int data2)
{
if (node == NULL)
return;

if(node->value == data1){
if(node->left!=NULL){
node->right = newNode(data2);
}else{
node->left = newNode(data2);
}
return;
}

putNode(node->left,data1,data2);
putNode(node->right,data1,data2);
}

int weight(struct node* node)
{
   if(node==NULL)
       return 0;

   else
   {
       int leftb=weight(node->left);
       int rightb=weight(node->right);
       return max(leftb,rightb)+1;
   }
}

int isComplete (struct node * node)
{

if (node == NULL) return TRUE;

int ld=weight(node->left);
int rd=weight(node->right);

return(ld==rd && isComplete(node->left) && isComplete(node->right));

}

int isBalanced(struct node* node) {
if (node == NULL) {
return TRUE;
}
int left = weight(node->left);
int right = weight(node->right);
return abs(left - right) <= 1 && isBalanced(node->left) && isBalanced(node->right);
}

int main()
{
FILE *fp;
char fname[50] = "start.txt";

fp = fopen(fname, "r");

if(fp == NULL)
{
printf("Can't open file\n");
}
int arr1[200]={0},arr2[200]={0};
char c = fgetc(fp);
int p1=0,p2=0;
while (c != EOF)
{
c = fgetc(fp);
arr1[p1++] = (int)(c)-48;
c = fgetc(fp);
c = fgetc(fp);
arr2[p2++] = (int)(c)-48;
c =fgetc(fp);
c =fgetc(fp);
c =fgetc(fp);

}
struct node* root = newNode(arr1[0]);
for(int i = 0 ; i < p1; i++){
putNode(root,arr1[i],arr2[i]);
}
FILE *fo = fopen("output.txt", "w");
if (fo == NULL)
{
printf("Error opening file!\n");
exit(1);
}
int complete = isComplete(root);
if(complete){
const char *text = "YES";
fprintf(fo, "Is the tree complete? %s\n", text);
}else{
const char *text = "NO";
fprintf(fo, "Is the tree complete? %s\n", text);
}

int w = weight(root);
fprintf(fo, "What is the weight of the tree? %d\n", w);

int b = isBalanced(root);
if(b){
const char *text = "YES";
fprintf(fo, "Is it balanced? %s\n", text);
}else{
const char *text = "NO";
fprintf(fo, "Is it balanced? %s\n", text);
}

fclose(fp);
fclose(fo);

return 0;
}