inorder(node) if (node = null) return inorder(node.left) visit(node) inorder(node.right) iterativeInorder(node) s ← empty stack while (not s.isEmpty() or node ≠ null) if (node ≠ null) s.push(node) node ← node.left else node ← s.pop() visit(node) node ← node.right