OneBug-二叉树的中序遍历

题目

给出一棵二叉树,返回其中序遍历

样例

给出二叉树 {1,#,2,3},

1

2
/
3
返回 [1,3,2].

代码实现

递归版本

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */

class Solution {
public:
    /**
     * @param root: A Tree
     * @return: Inorder in ArrayList which contains node values.
     */
     stack<TreeNode*> stk;
     vector<int> ans;
     void dfs(TreeNode* t){
         if(!t)return;
         dfs(t->left);
         ans.push_back(t->val);
         dfs(t->right);
     }
    vector<int> inorderTraversal(TreeNode * root) {
        // write your code here
        dfs(root);
        return ans;
    }
};

####### 非递归版本

Not yet