Software 1 - Structures (9)

administrivia

Web Page - http://www.cs.tau.ac.il/~efif/courses/Software1_Spring_03

A Thief with a key is still a thief

• Don't reference freed memory

  while (ptr != NULL) { free(ptr); ptr = ptr->next; }

Print Values

/*! Print the tree pointed by root in ascending order */ void print_tree(Node *root) { if (!root) return; print_tree(root->left); printf("%d ", root->value); print_tree(root->right); }

Simple Binary Tree

• btree.c