Given a binary tree, perform an inorder traversal without using recursion.

Use a stack to simulate the recursive inorder traversal process

• Create an empty stack to store nodes

• Start with the root node and push it onto the stack

• While the stack is not empty, keep traversing left...read more