Exercise: Binary Tree Traversal III labuladong Original About 10974 words
437. 路径总和 III https://leetcode.cn/problems/path-sum-iii 437. Path Sum III https://leetcode.com/problems/path-sum-iii 513. 找树左下角的值 https://leetcode.cn/problems/find-bottom-left-tree-value 513. Find Bottom Left Tree Value https://leetcode.com/problems/find-bottom-left-tree-value 666. 路径总和 IV https://leetcode.cn/problems/path-sum-iv 666. Path Sum IV https://leetcode.com/problems/path-sum-iv 1261. 在受污染的二叉树中查找元素 https://leetcode.cn/problems/find-elements-in-a-contaminated-binary-tree 1261. Find Elements in a Contaminated Binary Tree https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree 386. 字典序排数 https://leetcode.cn/problems/lexicographical-numbers 386. Lexicographical Numbers https://leetcode.com/problems/lexicographical-numbers 1104. 二叉树寻路 https://leetcode.cn/problems/path-in-zigzag-labelled-binary-tree 1104. Path In Zigzag Labelled Binary Tree https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree 1145. 二叉树着色游戏 https://leetcode.cn/problems/binary-tree-coloring-game 1145. Binary Tree Coloring Game https://leetcode.com/problems/binary-tree-coloring-game 1612. 检查两棵二叉表达式树是否等价 https://leetcode.cn/problems/check-if-two-expression-trees-are-equivalent 1612. Check If Two Expression Trees are Equivalent https://leetcode.com/problems/check-if-two-expression-trees-are-equivalent 2096. 从二叉树一个节点到另一个节点每一步的方向 https://leetcode.cn/problems/step-by-step-directions-from-a-binary-tree-node-to-another 2096. Step-By-Step Directions From a Binary Tree Node to Another https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another 572. 另一棵树的子树 https://leetcode.cn/problems/subtree-of-another-tree 572. Subtree of Another Tree https://leetcode.com/problems/subtree-of-another-tree 1367. 二叉树中的列表 https://leetcode.cn/problems/linked-list-in-binary-tree 1367. Linked List in Binary Tree https://leetcode.com/problems/linked-list-in-binary-tree Prerequisite Knowledge
Before reading this article, you should first learn:
Binary tree problems often include other algorithmic techniques, but they all rely on the binary tree traversal framework. Let's look at a few examples to understand this better.
Prev
Exercise: Binary Tree Traversal II
Next
Exercise: Binary Tree Divide and Conquer I