JAVA_Binary Tree Inorder Traversal_LeetCode 94

JAVA_Binary Tree Inorder Traversal_LeetCode 94 Binary Tree Inorder Traversal 풀이 class Solution { public List inorderTraversal(TreeNode root) { List inorder = new ArrayList(); inorderTraversal(root, inorder); return inorder; } public void inorderTraversal(TreeNode root, List 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...