알고리즘
[Leetcode/Python] Symmetric Tree
Top Interview Questions 의 Easy Collection에 있는 문제입니다. 문제는 여기서 볼 수 있습니다. Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center). Example 1: Input: root = [1,2,2,3,4,4,3] Output: true Example 2: Input: root = [1,2,2,null,3,null,3] Output: false Constraints: The number of nodes in the tree is in the range [1, 1000]. -100 bool: if not root: return ..
2022. 8. 25. 15:48