JAVA_Binary Tree Postorder Traversal_LeetCode 145

JAVA_Binary Tree Postorder Traversal_LeetCode 145 풀이 class Solution { public List<Integer> postorderTraversal(TreeNode root) { LinkedList<Integer> ans = new LinkedList<>(); Stack<TreeNode> stack = new Stack<>(); if (root == null) return ans; stack.push(root); while (!stack.isEmpty()) { TreeNode tree = stack.pop(); ans.addFirst(tree.val); if (tree.left != null) stack.push(tree.left); if (tree.right != null) stack.push(tree.right); } return ans; } } * 출처 Level up your coding skills and quickly lan...

원문링크 : JAVA_Binary Tree Postorder Traversal_LeetCode 145