Exercise: Binary Tree Divide and Conquer II
OriginalAbout 2967 words
Prerequisites
Before reading this article, you should first learn:
Technique One
For problems like determining if a binary tree is a mirror image or inverting a binary tree, you can generally use the problem decomposition approach. This means breaking down the problem of the entire tree (the original problem) into problems involving its subtrees (subproblems).