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]
.
思路:简单的先序搜索
代码:
/**
* Definition for binary tree
* 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> res;
inorder(root,res);
return res;
}
void inorder(TreeNode *root, vector<int> &res){
if(root==NULL) return;
inorder(root->left,res);
res.push_back(root->val);
inorder(root->right,res);
}
};