题目
给定一个二叉树的根节点 root
,返回它的 中序 遍历。
代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> list=new ArrayList<Integer>();
inorder(root,list);
return list;
}
void inorder(TreeNode root,List<Integer> list)
{
if(root==null)
return ;
inorder(root.left,list);
list.add(root.val);
//System.out.println(" "+list+" ");
inorder(root.right,list);
}
}
反思
其他算法,
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> list=new ArrayList<Integer>();
Stack<TreeNode> stack=new Stack<>();
TreeNode node=root;
while(node!=null||!stack.isEmpty())
{
if(node!=null)
{
stack.push(node);
node=node.left;
}
else{
node=stack.pop();
list.add(node.val);
node=node.right;
}
}
return list;
}
}