Count nodes in a binary tree without using recursion

• Use a stack to keep track of nodes to visit

• Pop nodes from the stack and increment count for each node visited

• Continue until stack is empty