94. Binary Tree Inorder Traversal

• Difficulty: Medium

• Topics: Hash Table, Stack, Tree

• Similar Questions:

  • Validate Binary Search Tree

  • Binary Tree Preorder Traversal

  • Binary Tree Postorder Traversal

  • Binary Search Tree Iterator

  • Kth Smallest Element in a BST

  • Closest Binary Search Tree Value II

  • Inorder Successor in BST

  • Convert Binary Search Tree to Sorted Doubly Linked List

  • Minimum Distance Between BST Nodes

Problem:

Given a binary tree, return the inorder traversal of its nodes' values.

Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [1,3,2]

Follow up: Recursive solution is trivial, could you do it iteratively?

Solutions:

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> ret;

        TreeNode* cur = root;
        while (cur) {
            TreeNode* pre = cur->left;
            if (pre == nullptr) {
                ret.push_back(cur->val); // visit
                cur = cur->right;
                continue;
            }

            while (pre->right != nullptr && pre->right != cur) {
                pre = pre->right;
            }

            if (pre->right == nullptr) {
                pre->right = cur;
                cur = cur->left;
            } else {
                pre->right = nullptr;
                ret.push_back(cur->val); // visit
                cur = cur->right;
            }
        }

        return ret;

    }
};