递归方式
前序遍历
public List<Integer> res = new ArrayList<Integer>();
public List<Integer> postorderTraversal(TreeNode root) {
if(root == null)
return res;
res.add(root.val);
postorderTraversal(root.left);
postorderTraversal(root.right);
return res;
}
中序遍历
public List<Integer> res = new ArrayList<Integer>();
public List<Integer> postorderTraversal(TreeNode root) {
if(root == null)
return res;
postorderTraversal(root.left);
res.add(root.val);
postorderTraversal(root.right);
return res;
}
后序遍历
public List<Integer> res = new ArrayList<Integer>();
public List<Integer> postorderTraversal(TreeNode root) {
if(root == null)
return res;
postorderTraversal(root.left);
postorderTraversal(root.right);
res.add(root.val);
return res;
}
非递归方式
前序遍历
教科书
public void preorderTraversal(TreeNode root) {
Stack<TreeNode> stack = new Stack<>();
do{
while(root!=null){
System.out.println(root.val);
stack.push(root);
root = root.left;
}
if(stack.size()!=0){
root = stack.pop();
root = root.right;
}
}while(stack.size()!=0 || root!=null);
}
更简单的方法
public void preorderTraversal(TreeNode root) {
Stack<TreeNode> stack = new Stack<>();
if(root == null){
return;
}
stack.push(root);
while(!stack.isEmpty()){
root = stack.pop();
System.out.println(root.val);
if(root.right != null) stack.push(root.right);
if(root.left != null) stack.push(root.left);
}
}
中序遍历
教科书
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
Stack<TreeNode> stack = new Stack<>();
do{
while(root!=null){
stack.push(root);
root = root.left;
}
if(stack.size()!=0){
root = stack.pop();
list.add(root.val);
root = root.right;
}
}while(stack.size()!=0 || root!=null);
return list;
}
更简单的方法
public List<Integer> iteration(TreeNode root) {
if (root == null) return new ArrayList<>();
List<Integer> results = new ArrayList<>();
Stack<TreeNode> stack=new Stack();
TreeNode node = root;
while (node != null || stack.size() != 0) {
if (node != null) {
stack.push(node);
node = node.left;
} else {
node = stack.pop();
results.add(node.val);
node = node.right;
}
}
return results;
}
后序遍历
教科书
public List<Integer> postOrderNonCur(TreeNode root){
List<Integer> resultList=new ArrayList<>();
if(root==null)
return resultList;
Map<TreeNode,Integer> visitedMap=new HashMap<>();
Stack<TreeNode> toBeVisitedStack=new Stack<>();
toBeVisitedStack.push(root);
while(!toBeVisitedStack.isEmpty()){
TreeNode tempNode=toBeVisitedStack.peek();
if(tempNode.left==null && tempNode.right==null){
resultList.add(tempNode.val);
visitedMap.put(tempNode, 1);
toBeVisitedStack.pop();
continue;
}else if(!((tempNode.left!=null&&visitedMap.get(tempNode.left)==null )|| (tempNode.right!=null && visitedMap.get(tempNode.right)==null))){
resultList.add(tempNode.val);
toBeVisitedStack.pop();
visitedMap.put(tempNode, 1);
continue;
}
if(tempNode.left!=null){
while(tempNode.left!=null && visitedMap.get(tempNode.left)==null){
toBeVisitedStack.push(tempNode.left);
tempNode=tempNode.left;
}
}
if(tempNode.right!=null){
if(visitedMap.get(tempNode.right)==null){
toBeVisitedStack.push(tempNode.right);
}
}
}
return resultList;
}
更简单的方法
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<Integer>();
if(root == null)
return res;
Stack<TreeNode> stack = new Stack<TreeNode>();
stack.push(root);
while(!stack.isEmpty()){
TreeNode node = stack.pop();
if(node.left != null) stack.push(node.left);
if(node.right != null) stack.push(node.right);
res.add(0,node.val);
}
return res;
}