leetcode same tree
![[LeetCode] 100 Same Tree [Easy] 같은 트리](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2F4AIcg%2FbtsylA18qai%2FAdpXfMR8sQrd5B05WpCkL0%2Fimg.jpg)
[LeetCode] 100 Same Tree [Easy] 같은 트리
100. Same Tree 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 identical, and the nodes have the same value. Example 1: Input: p = [1,2,3], q = [1,2,3] Output: true Example 2: Input: p = [1,2], q = [1,null,2] Output: false Example 3: Input: p = [1,2,1], q = [1,1,2] Output: false ..