题解 | #二叉树的中序遍历#
二叉树的中序遍历
http://www.nowcoder.com/practice/0bf071c135e64ee2a027783b80bf781d
C++代码:
class Solution {
private:
vector<int> ans;
public:
vector<int> inorderTraversal(TreeNode* root) {
midTrack(root);
return ans;
}
void midTrack(TreeNode *root) {
if (root) {
midTrack(root->left);
ans.push_back(root->val);
midTrack(root->right);
}
}
};