【LeetCode】543. Diameter of Binary Tree

543. Diameter of Binary Tree

Description：
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.
Note: The length of path between two nodes is represented by the number of edges between them.
Difficulty：Easy
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].

方法: recursive

• Time complexity : $O\left(n\right)$
• Space complexity : $O\left(n\right)$
  思路：
  写一个求深度的函数，再初始化一个类属性用于记录最大的路径，在求深度的时候穿插一句比较大小即可。

 
class Solution {
public:
	int res;
	int diameterOfBinaryTree(TreeNode* root) {
		res = 0;
		depth(root);
		return res;
	}
	int depth(TreeNode* root) {
		if (root == NULL) return 0;
		int l = depth(root->left);
		int r = depth(root->right);
		res = max(res, l + r);
		return max(l, r) + 1;
	}
};