#Leetcode# 94. Binary Tree Inorder Traversal
Posted 丧心病狂工科女
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了#Leetcode# 94. Binary Tree Inorder Traversal相关的知识，希望对你有一定的参考价值。
https://leetcode.com/problems/binary-tree-inorder-traversal/
Given a binary tree, return the inorder traversal of its nodes‘ values.
Example:
Input: [1,null,2,3]
1
2
/
3
Output: [1,3,2]
代码：
/**
* Definition for a binary tree node.
* 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> ans;
inorder(ans, root);
return ans;
}
void inorder(vector<int>& ans, TreeNode* root) {
if(root == NULL) return ;
inorder(ans, root -> left);
ans.push_back(root -> val);
inorder(ans, root -> right);
}
};
二叉树 get 第一个 Medium 中序遍历
以上是关于#Leetcode# 94. Binary Tree Inorder Traversal的主要内容，如果未能解决你的问题，请参考以下文章
LeetCode 94:Binary Tree Inorder Traversal
[leetcode-94-Binary Tree Inorder Traversal]
[LeetCode]94.Binary Tree Inorder Traversal
LeetCode 94: Binary Tree Inorder Traversal