Skip to content

Instantly share code, notes, and snippets.

@InterviewBytes
Created June 10, 2017 18:02
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
Star You must be signed in to star a gist
Save InterviewBytes/373f46b7852c09ea78f8736e5f4f334e to your computer and use it in GitHub Desktop.
Postorder recursive
package com.interviewbytes.trees;
import java.util.ArrayList;
import java.util.List;
public class PostorderRecursive {
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
helper(root, list);
return list;
}
private void helper(TreeNode node, List<Integer> list) {
if (node == null) return;
helper(node.left, list);
helper(node.right, list);
list.add(node.val);
}
}
package com.interviewbytes.trees;
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) {
val = x;
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment