JAVA_Binary Tree Preorder Traversal_LeetCode 144

JAVA_Binary Tree Preorder Traversal_LeetCode 144 풀이 class Solution { public List<Integer> preorderTraversal(TreeNode root) { List<Integer> pre = new LinkedList<Integer>(); if(root==null) return pre; Stack<TreeNode> stack = new Stack<TreeNode>(); 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...

원문링크 : JAVA_Binary Tree Preorder Traversal_LeetCode 144