🧩 Algorithm/LeetCode

💡 오늘의 학습 키워드더보기📌  완전 이진 트리 문제 설명문제 링크 : https://leetcode.com/problems/reverse-odd-levels-of-binary-tree/Given the root of a perfect binary tree, reverse the node values at each odd level of the tree.For example, suppose the node values at level 3 are [2,1,3,4,7,11,29,18], then it should become [18,29,11,7,4,3,1,2].Return the root of the reversed tree.A binary tree is perfect if all parent node..

문제 설명You have a set which contains all positive integers [1, 2, 3, 4, 5, ...].Implement the SmallestInfiniteSet class:SmallestInfiniteSet() Initializes the SmallestInfiniteSet object to contain all positive integers.int popSmallest() Removes and returns the smallest integer contained in the infinite set.void addBack(int num) Adds a positive integer num back into the infinite set, if it is not al..