Boston University -- Computer Science Department

Trees

tree.c

testInorder

testPostorder

Compile the program by gcc -Wall tree.c

Your assignment for this lab will consist of writing 4 functions that are defined in the file tree.c.

• Write a function to print the tree in postorder. Check it using the file testPostorder by running

  a.out

  If your function is correct then function printPostorder will print a familiar poem.

• Write a function to print the tree in inorder. Check it using the file testInorder by running

  a.out

  If your function is correct then function printInorder will print a familiar poem.

• Write a function to calculate a number of nodes in the tree. Right now this function always returns -1.
• Write a function to calculate a depth the tree (the length of the longest branch in the tree). Right now this function always returns -1.
• After your functions are written and debugged, prepare a typescipt that uses cat to display the tree.c, gcc -Wall tree.c to show compilation and two runs of your program: once with testPostorder and another run with testInorder. Circle the poems you got for each run of your program. This script must be submitted for grading.
• Draw a tree for each file, showing all the nodes. Check your functions countNodes and depth by hand using these trees. These drawings and calculations must also be submitted for grading.