A quadtree is a tree data structure in which each internal node has exactly four children.
Given a n * n matrix grid of 0's and 1's only. We want to represent the grid with a Quad-Tree.
Return the root of the Quad-Tree representing the grid.
Notice that you can assign the value of a node to True or False when isLeaf is False, and both are accepted in the answer.
Definition for a QuadTree node.
class Node {
public:
bool val;
bool isLeaf;
Node* topLeft;
Node* topRight;
Node* bottomLeft;
Node* bottomRight;
Node() {
val = false;
isLeaf = false;
topLeft = NULL;
topRight = NULL;
bottomLeft = NULL;
bottomRight = NULL;
}
Node(bool _val, bool _isLeaf) {
val = _val;
isLeaf = _isLeaf;
topLeft = NULL;
topRight = NULL;
bottomLeft = NULL;
bottomRight = NULL;
}
Node(bool _val, bool _isLeaf, Node* _topLeft, Node* _topRight, Node* _bottomLeft, Node* _bottomRight) {
val = _val;
isLeaf = _isLeaf;
topLeft = _topLeft;
topRight = _topRight;
bottomLeft = _bottomLeft;
bottomRight = _bottomRight;
}
};
We can construct a Quad-Tree from a two-dimensional area using the following steps:
If the current grid has the same value (i.e all 1's or all 0's) set isLeaf True and set val to the value of the grid and set the four children to Null and stop.
If the current grid has different values, set isLeaf to False and set val to any value and divide the current grid into four sub-grids as shown in the photo.
Recurse for each of the children with the proper sub-grid.
If you want to know more about the Quad-Tree, you can refer to the wiki.
Quad-Tree format:
The output represents the serialized format of a Quad-Tree using level order traversal, where null signifies a path terminator where no node exists below.
It is very similar to the serialization of the binary tree. The only difference is that the node is represented as a list [isLeaf, val].
If the value of isLeaf or val is True we represent it as 1 in the list [isLeaf, val] and if the value of isLeaf or val is False we represent it as 0.
Example:
Input: grid = [[0,1],[1,0]]
Output: [[0,1],[1,0],[1,1],[1,1],[1,0]]
Solution:
Recursively divide the grid by four and check if it is the leaf and its value is same as the other three.
Node* construct(vector<vector<int>>& grid) {
int n = (int) grid.size();
return build(grid, 0, 0, n);
}
Node* build(vector<vector<int>>& grid, int i, int j, int n) {
if(n == 1) return new Node(grid[i][j], true);
Node* res = new Node(0, false,
build(grid, i, j, n / 2),
build(grid, i, j + n / 2, n / 2),
build(grid, i + n / 2, j, n / 2),
build(grid, i + n / 2, j + n / 2, n / 2));
if(
res->topLeft->isLeaf &&
res->topRight->isLeaf &&
res->bottomLeft->isLeaf &&
res->bottomRight->isLeaf &&
res->topLeft->val == res->topRight->val &&
res->topLeft->val == res->bottomLeft->val &&
res->topLeft->val == res->bottomRight->val
) {
res->val = res->topLeft->val;
res->isLeaf = true;
delete res->topLeft;
delete res->topRight;
delete res->bottomLeft;
delete res->bottomRight;
res->topLeft = NULL;
res->topRight = NULL;
res->bottomLeft = NULL;
res->bottomRight = NULL;
}
return res;
}
Top comments (0)