Exercise: Binary Tree Divide and Conquer II

labuladongOriginalAbout 2967 words

Prerequisites

Before reading this article, you should first learn:

Basics of Binary Tree Traversal
Binary Tree Principles (Construction)
Binary Tree Principles (Summary)

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).

100. Same Tree

Thoughts

Solution

Algo Visualizer

101. Symmetric Tree

Exercise: Binary Tree Divide and Conquer II

100. Same Tree https://leetcode.com/problems/same-tree

101. Symmetric Tree https://leetcode.com/problems/symmetric-tree

951. Flip Equivalent Binary Trees https://leetcode.com/problems/flip-equivalent-binary-trees

124. Binary Tree Maximum Path Sum https://leetcode.com/problems/binary-tree-maximum-path-sum

Technique One

100. Same Tree

Thoughts

Solution

Algo Visualizer

101. Symmetric Tree

Thoughts

Solution

Algo Visualizer

951. Flip Equivalent Binary Trees

Thoughts

Solution

Algo Visualizer

Technique Two

124. Binary Tree Maximum Path Sum

Thoughts

Solution

Algo Visualizer