LeetCode 543. 二叉树的直径

题目描述

543. 二叉树的直径

解法：DFS（Python）

这里的直径是指树中最长的路径，那么以某个节点为起点，最长的路径就是从左子树走的长度 $L$ 加上从右子树走的长度 $R$

【注】走的长度不是经过的节点数，而是边数

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def diameterOfBinaryTree(self, root: TreeNode) -> int:
        self.ans = 0
        def depth(node):
            if not node: return 0
            L = depth(node.left)
            R = depth(node.right)
            self.ans = max(self.ans, L+R)
            return max(L, R) + 1
        depth(root)
        return self.ans

解法：（C++）

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int diameterOfBinaryTree(TreeNode* root) {
        int maxDiameter = 0;
        maxDepth(root, maxDiameter);
        return maxDiameter;
    }

    int maxDepth(TreeNode* root, int& maxDiameter){
        if (root == nullptr) return 0;
        int left_max = maxDepth(root->left, maxDiameter);
        int right_max = maxDepth(root->right, maxDiameter);
        int d = left_max + right_max;
        maxDiameter = max(maxDiameter, d);

        return 1 + max(left_max, right_max);
    }
};