JAVA_Binary Tree Preorder Traversal_LeetCode 144 풀이 class Solution { public List preorderTraversal(TreeNode root) { List pre = new LinkedList(); if(root==null) return pre; Stack stack = new Stack(); stack.push(root); while(!stack.empty()) { TreeNode tree = stack.pop(); pre.add(tree.val); if(tree.right!
=null) stack.push(tree.right); if(tree.left!=null) stack.push(tree.left); } return pre; } } * 출처 Level up your coding skills and quickly land a job.
T...
#
BinaryTreePreorderTraversal_LeetCode144
#
JAVA
#
JAVA_BinaryTreePreorderTraversal
#
JAVA_BinaryTreePreorderTraversal_LeetCode144
#
JAVA_LeetCode144
