给定一个二叉树,返回它的中序 遍历。
首先用递归
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public static List<Integer> inorderTraversal(TreeNode root){
List <Integer> list = new LinkedList<>();
if(root == null) { //root为空返回一个空list
return list;
}
LDR(list,root);
return list;
}
public static void LDR(List<Integer> list,TreeNode node) {
if(node.left != null) { //遍历节点左孩子节点
LDR(list,node.left);
}
list.add(node.val); //没有左节点,将本节点值存储,然后继续进行右孩子节点操作
if(node.right != null) {
LDR(list,node.right);
}
}
}
用栈
public static List<Integer> inorderTraversal(TreeNode root){
List <Integer> list = new LinkedList<>();
TreeNode temp ;
if(root == null) {
return list;
}
Stack <TreeNode> stack = new Stack<>();
temp = root;
while(!stack.isEmpty() || temp != null) {
if(temp != null) { //不为空入栈,直至左孩子为空
stack.push(temp);
temp = temp.left;
}else { //左孩子为空,出栈,对右节点操作。
//右孩子节点为空时,下一轮继续出栈,对右孩子操作。
temp = stack.pop();
list.add(temp.val);
temp = temp.right;
}
}
return list;
}
class Solution {
public static List<Integer> inorderTraversal(TreeNode root) {
LinkedList<Integer> list = new LinkedList<Integer>();
if(root == null) return list;
Stack<TreeNode> stack = new Stack<TreeNode>();
TreeNode node = root;
while(!stack.isEmpty() || node != null) {
while(node != null) {
stack.add(node);
node = node.left;
}
node = stack.pop();
list.add(node.val);
node = node.right;
}
return list;
}
}