[LeetCode] 226. Invert Binary Tree - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/invert-binary-tree/description/ Invert Binary Tree - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 Given the root of a binary tree, invert the tree, and return its root. Example 1: Input: root = [4,2,7,1,3,6,9] Output: [4,7,2,9,6,3,1] Example 2: I..
[LeetCode] 100. Same Tree - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/same-tree/description/ Same Tree - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally ..
HYOJUN
'이진트리' 태그의 글 목록