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]
Follow up: Recursive solution is trivial, could you do it iteratively?
分析:二叉树的中序遍历。 递归。
/**
* 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:
void inOrder(TreeNode* root, vector<int>& res) {
if(root->left)
inOrder(root->left,res);
res.push_back(root->val);
if(root->right)
inOrder(root->right,res);
}
vector<int> inorderTraversal(TreeNode* root) {
vector<int>res;
if(!root)
return res;
inOrder(root, res);
return res;
}
};
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public void inOrder(TreeNode root, List<Integer> res){
if(root.left!=null) inOrder(root.left, res);
res.add(root.val);
if(root.right!=null) inOrder(root.right, res);
}
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer>res=new ArrayList<>();
if(root==null){
return res;
}
inOrder(root, res);
return res;
}
}
非递归:
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def inorderTraversal(self, root):
"""
:type root: TreeNode
:rtype: List[int]
"""
res, tmp = [], []
while root or len(tmp)>0:
while root:
tmp.append(root)
root=root.left
res.append(tmp[-1].val)
root=tmp[-1].right
del tmp[-1]
return res