what is the non-recursive stack equivalent of the following method?
boolean isTreeFull(TreeNode node) {
if (node == null) return true;
if (height(node.left) != height(node.right)) return false;
return isTreeFull(node.left) && isTreeFull(node.right);
}