#include "binary-tree.h"


template <class Item, class Func>
void preOrderWalk(BinaryTree<Item> *bt, Func f)
{
  if (bt != NULL) {
    f(bt->valOf());
    preOrderWalk(bt->leftOf(), f);
    preOrderWalk(bt->rightOf(),f);
  }
}


template <class Item, class Func>
void postOrderWalk(BinaryTree<Item> *bt, Func f)
{
  if (bt != NULL) {
    postOrderWalk(bt->leftOf(), f);
    postOrderWalk(bt->rightOf(),f);
    f(bt->valOf());
  }
}


template <class Item, class Func>
void inOrderWalk(BinaryTree<Item> *bt, Func f)
{
  if (bt != NULL) {
    inOrderWalk(bt->leftOf(), f);
    f(bt->valOf());
    inOrderWalk(bt->rightOf(),f);
  }
}