题目描述:
给出一棵二叉树,返回其中序遍历
您在真实的面试中是否遇到过这个题? Yes
样例
给出二叉树 {1,#,2,3},
1
\
2
/
3
返回 [1,3,2].
思路分析:
dfs遍历。
ac代码:
/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
/**
* @param root: The root of binary tree.
* @return: Inorder in vector which contains node values.
*/
public:
vector<int> v;
void dfs(TreeNode *root)
{
if(root==NULL)
return ;
dfs(root->left);
v.push_back(root->val);
dfs(root->right);
}
vector<int> inorderTraversal(TreeNode *root) {
// write your code here
dfs(root);
return v;
}
};