Iterative InOrder Tree Traversal (C++)

InOrder Traversal: Left Root Right

Stack Space: Proportional to the height of the tree

void iterativeInOrderTraverse(Node *root) {
  stack<Node *> nodes;
  Node *currNode = root;

  while(true) {
    if (currNode) {
      Node *leftNode = currNode->left;
      currNode = leftNode;
    else if (nodes.empty())
    else {
      currNode =;
      printf("%c ", currNode->data);
      Node *rightNode = currNode->right;
      currNode = rightNode;
This entry was posted in Coding and tagged , , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s