C++

Dynamic Quad Tree One day. Kevin came up with another more challenging question about quad tree As previously, quad tree data structure can represent a black-white image. In this question, you will be given a picture containing only black and white pixels. By operating on a single pixel. we can flip a pixel from .0' to 1, or from . 1, to-o.. And after each operation, you are required to output the total number of nodes in the corresponding quad tree of the current picture NW SW SE NE Input: The input contains multiple cases. The first line contains a single integer T indicating the number of test cases. Each test case begins with one integer k, indicating the size (n x n) of the image, where n - 2k and 0 s k