Construct Quad Tree || Leaf Node Grid

Hit like. 2/27/2022 Daily Problem
The time complexity is O(n^2logn), where n is a side legnth of the grid. Ya can't do much better than that, since worst-case it's a checkerboard pattern, and
#leetcode #computerscience #cs #algorithm #tutorial #teaching #learning #dsa #dfs #bfs #datastructures #greedy #stack #graph #disjointsets #unionfind #levelordertraversal #tree #dynamicprogramming #dp #bigonotation #heap #caching #memoization #tabulation #traversal #pathfinding #recursive #recursion #primm's #kruskal's #ackermann #priorityqueue