leetcode 563. 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.

思路解析

方法一：

主要是递归思想，整体架构是当前根节点的坡度加上左右子树所有节点的坡度。而当前根节点的坡度等于左子树所有节点之和加上右子树的所有节点之和。牵扯到的子问题是求一棵树的所有节点之和，即遍历棵树求所有节点的和。

/**
 * 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 findTilt(TreeNode* root) {
        if (root == NULL) return 0;
        int rootTilt = abs(sumTilt(root->left) - sumTilt(root->right));
        return rootTilt + findTilt(root->left) + findTilt(root->right);       
    }
    //求一棵树的所有节点之和,相当于遍历整棵树
    int sumTilt(TreeNode* root){
        if (root == NULL) return 0;
        return root->val + sumTilt(root->left) + sumTilt(root->right);
    }
    
};

方法二：

方法一主要是造成了大量重复子问题即求某一棵树的节点和。

public class Solution {
    int tilt=0;
    public int findTilt(TreeNode root) {
        traverse(root);
        return tilt;
    }
    public int traverse(TreeNode root)
    {
        if(root==null )
            return 0;
        int left=traverse(root.left);
        int right=traverse(root.right);
        tilt+=Math.abs(left-right);
        return left+right+root.val;
    }
}

作者：LeetCode
链接：https://leetcode-cn.com/problems/binary-tree-tilt/solution/er-cha-shu-de-po-du-by-leetcode/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。