JAVA_Binary Tree Inorder Traversal_LeetCode 94 Binary Tree Inorder Traversal 풀이 class Solution { public List<Integer> inorderTraversal(TreeNode root) { List<Integer> inorder = new ArrayList<>(); inorderTraversal(root, inorder); return inorder; } public void inorderTraversal(TreeNode root, List<Integer> inorder) { if (root == null) return; inorderTraversal(root.left, inorder); inorder.add(root.val); inorderTraversal(root.right, inorder); } } * 출처 Level up your coding skills and quickly land a job...
#BinaryTreeInorderTraversal_LeetCode94
#JAVA
#JAVA_BinaryTreeInorderTraversal
#JAVA_BinaryTreeInorderTraversal_LeetCode94
#JAVA_LeetCode94
원문링크 : JAVA_Binary Tree Inorder Traversal_LeetCode 94
네이버 블로그
티스토리
커뮤니티