Merge pull request neetcode-gh#1235 from thecodeboy/diameterOfBinaryTree

Create: 543-Diameter-of-Binary-Tree.go

Author: Ahmad-A0

go/543-Diameter-of-Binary-Tree.go

@@ -0,0 +1,32 @@
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+func diameterOfBinaryTree(root *TreeNode) int {
+	maxLength := 0
+	dfs(root, &maxLength)
+	return maxLength
+}
+
+func dfs(t *TreeNode, maxLength *int) int {
+	if t == nil {
+		return 0
+	}
+
+	left := dfs(t.Left, maxLength)
+	right := dfs(t.Right, maxLength)
+	*maxLength = max(*maxLength, left+right)
+
+	return max(left, right) + 1
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}