https://leetcode.com/problems/binary-tree-right-side-view/ Binary Tree Right Side View - 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 이진트리의 root가 주어졌을 때, root부터 tree의 최상위 레벨까지 오른쪽에서 왼쪽으로 봤을 때(val); for (int i=0; iright) { queue_.push(temp_v[i]->right); } if (temp_v[i]->left) { q..
