Leetcode563.+Leetcode543. DFS之应用（一）：求解树计算问题

Leetcode563. Binary Tree Tilt

题目

Given a binary tree, return the tilt of the whole tree.
The tilt of a tree node is defined as the absolute difference between the sum of all left subtree node values and the sum of all right subtree node values. Null node has tilt 0.
The tilt of the whole tree is defined as the sum of all nodes’ tilt.

Example:
Input:
1
/ \
2 3
Output: 1
Explanation:
Tilt of node 2 : 0
Tilt of node 3 : 0
Tilt of node 1 : |2-3| = 1
Tilt of binary tree : 0 + 0 + 1 = 1

解题分析

这道题其实不难，关键是要理清解题的思路。今天把这道题放在这里，是因为比较有代表性。通过例子我们可以发现，我们需要计算每个节点的tilt值，然后统计它们的总和。而每个节点的tilt值是其左右子树的tilt值的差的绝对值。因此我们只需递归调用求tilt值的函数就可以了，注意在函数中返回当前节点的tilt值，以便于后面的统计，下面简要附上源代码：

源代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int tilt = 0;

    int findTilt(TreeNode* root) {
        absTilt(root);
        return tilt;
    }

    int absTilt(TreeNode* root) {
        if(root != NULL) {
            int left, right;
            left = absTilt(root->left);
            right = absTilt(root->right);
            tilt += abs(left - right);
            return left + right + root->val;
        }
        return 0;
    }
};

Leetcode543. Diameter of Binary Tree

题目

Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.

Example:
Given a binary tree
1
/ \
2 3
/ \
4 5
Return 3, which is the length of the path [4,2,1,3] or [5,2,1,3].

Note: The length of path between two nodes is represented by the number of edges between them.

解题分析

这道题其实和上面一样，解法上简直如出一辙。我们现在来简单分析一下这道题目。题目要求我们求解任意一个二叉树的diameter，而diameter被定义为二叉树中任意两个节点之间路径的最大值。而我们知道，要想diameter最大，肯定是要让这两个节点分布在树的两侧。因此，我们只需求出左边和右边节点对应的diameter的最大值，其和就是我们最终所要的结果。所以这道题又变成了一个递归调用，只需每次将所求得的diameter值与之前进行比较，并注意返回其左右子树的diameter的最大值，表示该节点的diameter。

源代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int diameter = 0;

    int diameterOfBinaryTree(TreeNode* root) {
        maxDiameter(root);
        return diameter;
    }

    int maxDiameter(TreeNode* root) {
        if (root == NULL) {
            return 0;
        }
        int left = maxDiameter(root->left);
        int right = maxDiameter(root->right);
        diameter = max(diameter, left + right);
        return max(left, right) + 1;
    }
};

以上是我对这两道树计算问题的一些想法，有问题还请在评论区讨论留言~