题目链接:https://oj.leetcode.com/problems/binary-tree-inorder-traversal/
题目:
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3}
,
1 \ 2 / 3
return [1,3,2]
.
Note: Recursive solution is trivial, could you do it iteratively?
confused what "{1,#,2,3}"
means? > read more on how binary tree is serialized on OJ.
解题思路:基础的中序遍历
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
private:
vector<int> s;
public:
vector<int> inorderTraversal(TreeNode *root) {
inOrder(root);
return s;
}
void inOrder(TreeNode *root) {
if (root == NULL) return;
inOrder(root->left);
s.push_back(root->val);
inOrder(root->right);
}
};
转载请注明作者:vanish_dust