// BTNodeCount - count the number of nodes in the tree

public class BTNodeCount {

	public static void main(String[] args) {
		BTNode<Integer> root;

		root = beginningTree();

		root.preorderPrint();
		System.out.println();
		root.inorderPrint();
		System.out.println();
		root.postorderPrint();
		root.print(0);

		int n = countNodes(root);
		
		System.out.println("# of nodes = " + n);

	}

	public static BTNode<Integer> beginningTree() {
		BTNode<Integer> root;
		BTNode<Integer> child;

		root = new BTNode<Integer>(14, null, null);
		child = new BTNode<Integer>(17, null, null);
		root.setLeft(child);
		child.setLeft(new BTNode<Integer>(9, null, null));
		child.setRight(new BTNode<Integer>(53, null, null));
		child = child.getLeft();
		child.setLeft(new BTNode<Integer>(13, null, null));
		child = child.getLeft();
		child.setRight(new BTNode<Integer>(21, null, null));
		child = new BTNode<Integer>(11, null, null);
		root.setRight(child);
		child.setLeft(new BTNode<Integer>(4, null, null));
		child = child.getLeft();
		child.setLeft(new BTNode<Integer>(19, null, null));
		child.setRight(new BTNode<Integer>(7, null, null));

		return root;
	}

	public static int countNodes(BTNode<Integer> t) {

		int lMax;
		int rMax;
		
		if (t == null)
			return 0;
		else {
			if (t.isLeaf())
				return 1;
			else 
				return 1 + countNodes(t.getLeft()) + countNodes(t.getRight());
		}
			
	}
}