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

    /**
     * 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 depth(TreeNode* root, int& res){
            if(root == NULL) return 0;
            int left = depth(root->left, res);
            int right = depth(root->right, res);
            res = max(res, left+right);
            return 1+max(left,right);
        }
        int diameterOfBinaryTree(TreeNode* root) {
            int res = 0;
            depth(root, res);
            return res;
        }
    };
    
  • 相关阅读:
    二叉搜索树
    splay模板
    树状数组模板
    K尾相等数
    寻找最大数
    布线问题(最小生成树)
    开心的小明
    独木舟上的旅行(二)
    The Triangle(记忆化搜索)
    喷水装置(二)
  • 原文地址:https://www.cnblogs.com/A-Little-Nut/p/10073948.html
Copyright © 2011-2022 走看看