Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).root 노드를 기준으로 한칸씩 아래로 내려갈 때 마다 left, right

Given an integer n, return all the structurally unique BST's (binary search trees), which has exactly n nodes of unique values from 1 to n. Return the