270. 最接近的二叉搜索树值 https://leetcode.cn/problems/closest-binary-search-tree-value
270. Closest Binary Search Tree Value https://leetcode.com/problems/closest-binary-search-tree-value
404. 左叶子之和 https://leetcode.cn/problems/sum-of-left-leaves
404. Sum of Left Leaves https://leetcode.com/problems/sum-of-left-leaves
623. 在二叉树中增加一行 https://leetcode.cn/problems/add-one-row-to-tree
623. Add One Row to Tree https://leetcode.com/problems/add-one-row-to-tree
971. 翻转二叉树以匹配先序遍历 https://leetcode.cn/problems/flip-binary-tree-to-match-preorder-traversal
971. Flip Binary Tree To Match Preorder Traversal https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal
987. 二叉树的垂序遍历 https://leetcode.cn/problems/vertical-order-traversal-of-a-binary-tree
987. Vertical Order Traversal of a Binary Tree https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree
993. 二叉树的堂兄弟节点 https://leetcode.cn/problems/cousins-in-binary-tree
993. Cousins in Binary Tree https://leetcode.com/problems/cousins-in-binary-tree
1315. 祖父节点值为偶数的节点和 https://leetcode.cn/problems/sum-of-nodes-with-even-valued-grandparent
1315. Sum of Nodes with Even-Valued Grandparent https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent
1448. 统计二叉树中好节点的数目 https://leetcode.cn/problems/count-good-nodes-in-binary-tree
1448. Count Good Nodes in Binary Tree https://leetcode.com/problems/count-good-nodes-in-binary-tree
1469. 寻找所有的独生节点 https://leetcode.cn/problems/find-all-the-lonely-nodes
1469. Find All The Lonely Nodes https://leetcode.com/problems/find-all-the-lonely-nodes
1602. 找到二叉树中最近的右侧节点 https://leetcode.cn/problems/find-nearest-right-node-in-binary-tree
1602. Find Nearest Right Node in Binary Tree https://leetcode.com/problems/find-nearest-right-node-in-binary-tree
Prerequisites
Before reading this article, you should first learn:
If you need to perform operations on certain nodes in a binary tree, generally you can use the traversal mindset.
