cps 125 lab 9 help.c

#include <stdio.h>
#include <string.h>
/* the planets structure */
typedef struct 
{
	char name [10];
	double diameter;
	int moons;
	double orbit, rotation;
} planets_t;
 
/* the solar systems structure contains a planets type element */
typedef struct 
{
	double diameter;
	planets_t the_planets[8];
	char galaxy [10];
} solar_systems_t;

 
struct shape
{
  float line;
  float radius; 
};

int
main(void)
{

  struct shape planets ;
  planets.line = 2.0;
  planets.radius = 2.0;
  printf("Line is : %lf\n",planets.line);
  printf("Radius is : %lf\n",planets.radius);

planets_t planet = {"Earth", 1000, 1, 1.0, 24.0};
solar_systems_t solarsystem;
 
printf ("The planet %s has %d moon(s).\n", planet.name, planet.moons);
 
solarsystem.the_planets[2] = planet;
 
strcpy(planet.name, "Jupiter");
planet.diameter = 142980;
planet.moons = 16;
planet.orbit = 11.9;
planet.rotation = 9.925;
 
printf ("Planet %s has %d moon(s).\n", planet.name, planet.moons);
printf ("Planet %s has %d moon(s).\n", solarsystem.the_planets[2].name, 
					solarsystem.the_planets[2].moons);
 
return(0);
 
}

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define NL 20

typedef struct tree
{
char tree_name [NL];
struct tree* next;
}tree;

int
main (void)
{
/* temporary hold for tree name */
char name[NL];

/* declaring the starting and traveling pointers */
tree *p, *start;

/* list is empty at the beginning */
start = NULL;

/* enter first tree name (or END) */
printf ("Enter a tree name (END to finish): ");
fgets (name,sizeof(name),stdin);

p = (tree *) calloc (1, sizeof(tree));
strcpy (p -> tree_name, name);
p -> tree_name[strlen(name)-1] = '\0';

/* add tree name to the list and keep asking for more until END */
while (strcmp (name, "end") != 10)
{
	/* allocate new node to hold new tree */
	p = (tree *) calloc (1, sizeof(tree));
	/* put tree name into new node */
	strcpy (p -> tree_name, name);
	/* puts pointer to previous tree into pointer element */
	p -> next = start;
	/* updates start pointer with new tree */
	start = p;
	printf ("Enter a tree name (enter end to finish): ");
	fgets (name,sizeof(name),stdin);
p -> tree_name[strlen(name)-1] = '\0';
}
	
printf("\n-----------------");
    /* displays list of tree in reverse order */
p = start;
while (p != NULL)
{
	printf ("%s\n", p -> tree_name);
	p = p -> next;
}
return (0);

}