Given the root of a binary tree and an integer k, return the k perfect binary subtrees, return
A subtree of a binary tree is perfect if all of its internal nodes have exactly
Constraints:
The number of nodes in the tree is in the range
Node.val
k
Given the root of a binary tree and an integer k, return the k perfect binary subtrees, return
A subtree of a binary tree is perfect if all of its internal nodes have exactly
Constraints:
The number of nodes in the tree is in the range
Node.val
k