void antiClockPrintRec(BNode tree, boolean printLeft, boolean printRight) {
		if (tree == null)
			return;

		if (tree.isLeaf()) {
			// print leaves. avoid printing the leftmost and rightmost leaves
			// twice.
			if (!printLeft && !printRight) {
				prt.add(tree.value);
			}
			return;
		}

		// preorder traversal for left edge
		if (printLeft && tree.left != null) {
			prt.add(tree.left.value);
		}
		antiClockPrintRec(tree.left, printLeft, false);

		// postorder traversal for right edge
		antiClockPrintRec(tree.right, false, printRight);
		if (printRight && tree.right != null) {
			prt.add(tree.right.value);
		}
	}