public int depthOfNodeNoStorage(treeNode node) {
		count2++;
		if (node == null)
			return 0;

		int leftDepth = depthOfNodeNoStorage(node.leftLeaf);
		int rightDepth = depthOfNodeNoStorage(node.rightLeaf);

		return (leftDepth >= rightDepth ? leftDepth + 1 : rightDepth + 1);
	}