DeepestLeavesSum

Author: masx200

deepest-leaves-sum/export.go

@@ -0,0 +1,5 @@
+package index
+
+func DeepestLeavesSum(root *TreeNode) int {
+	return deepestLeavesSum(root)
+}

deepest-leaves-sum/go.mod

@@ -0,0 +1,7 @@
+module github.com/masx200/leetcode-test/deepest-leaves-sum
+
+go 1.19
+
+require github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree v0.0.0-20220817020324-66611ff0c589
+
+replace github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree v0.0.0-20220817020324-66611ff0c589 => ../serialize-and-deserialize-binary-tree

deepest-leaves-sum/go.sum

@@ -0,0 +1,2 @@
+github.com/google/go-cmp v0.5.8 h1:e6P7q2lk1O+qJJb4BtCQXlK8vWEO8V1ZeuEdJNOqZyg=
+gotest.tools/v3 v3.3.0 h1:MfDY1b1/0xN1CyMlQDac0ziEy9zJQd9CXBRRDHw2jJo=

deepest-leaves-sum/index.go

@@ -0,0 +1,26 @@
+package index
+
+import serialize_and_deserialize_binary_tree "github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree"
+
+type TreeNode = serialize_and_deserialize_binary_tree.TreeNode
+
+func deepestLeavesSum(root *TreeNode) (sum int) {
+	q := []*TreeNode{root}
+	for len(q) > 0 {
+		sum = 0
+
+		temp := []*TreeNode{}
+		for _, node := range q {
+
+			sum += node.Val
+			if node.Left != nil {
+				temp = append(temp, node.Left)
+			}
+			if node.Right != nil {
+				temp = append(temp, node.Right)
+			}
+		}
+		q = temp
+	}
+	return
+}

utils/TreeNodeLeetCodeParse.go

@@ -1,13 +1,22 @@
 package utils
 
 import treenode "github.com/egregors/TreeNode"
+import serialize_and_deserialize_binary_tree "github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree"
+
+type TreeNode = serialize_and_deserialize_binary_tree.TreeNode
 
 func TreeNodeLeetCodeParse(s string) *TreeNode {
 	var t, e = treenode.NewTreeNode(s)
 	if e != nil {
 		panic(e)
 	}
-	return t
+	return treeNodeNew(t)
 }
 
-type TreeNode = treenode.TreeNode
+func treeNodeNew(t *treenode.TreeNode) *TreeNode {
+
+	if t == nil {
+		return nil
+	}
+	return &TreeNode{Val: t.Val, Left: treeNodeNew(t.Left), Right: treeNodeNew(t.Right)}
+}

utils/TreeNodeLeetCodeStringify.go

@@ -1,6 +1,14 @@
 package utils
 
+import treenode "github.com/egregors/TreeNode"
+
 func TreeNodeLeetCodeStringify(t *TreeNode) string {
 
-	return t.String()
+	return treeNodeCreate(t).String()
+}
+func treeNodeCreate(t *TreeNode) *treenode.TreeNode {
+	if t == nil {
+		return nil
+	}
+	return &treenode.TreeNode{Val: t.Val, Left: treeNodeCreate(t.Left), Right: treeNodeCreate(t.Right)}
 }

utils/go.mod

@@ -3,3 +3,6 @@ module github.com/masx200/leetcode-test/utils
 go 1.19
 
 require github.com/egregors/TreeNode v1.0.3
+require github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree v0.0.0-20220817020324-66611ff0c589
+
+replace github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree v0.0.0-20220817020324-66611ff0c589 => ../serialize-and-deserialize-binary-tree