JAVA_Binary Tree Postorder Traversal_LeetCode 145 풀이 class Solution { public List postorderTraversal(TreeNode root) { LinkedList ans = new LinkedList(); Stack 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...
#
BinaryTreePostorderTraversal_LeetCode145
#
JAVA
#
JAVA_BinaryTreePostorderTraversal
#
JAVA_BinaryTreePostorderTraversal_LeetCode145
#
JAVA_LeetCode145
