zoukankan      html  css  js  c++  java
  • 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.

    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
    

    Note:

    • The sum of node values in any subtree won’t exceed the range of 32-bit integer.
    • All the tilt values won’t exceed the range of 32-bit integer.
    /**
     * 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 postorder(TreeNode* root){
            if(root==NULL) return 0;
            int leftsum=postorder(root->left);
            int rightsum=postorder(root->right);
            sum+=abs(leftsum-rightsum);
            return leftsum+rightsum+root->val;
        }
        int findTilt(TreeNode* root) {
            postorder(root);
            return sum;
        }
    private:
        int sum=0;
    };
    
  • 相关阅读:
    PTA(Basic Level)1038.统计同成绩学生
    PTA(Basic Level)1026.程序运行时间
    PTA(Basic Level)1031.查验身份证
    PTA(Basic Level)1061.判断题
    Windows 常用命令
    Windows安装启动MySQL
    classpath路径配置
    IDEA远程调试
    Java Effective 读书笔记
    Try Catch Finally总结
  • 原文地址:https://www.cnblogs.com/A-Little-Nut/p/10073981.html
Copyright © 2011-2022 走看看