github.com/masx200/leetcode-test/maximum-binary-tree

Author: masx200

maximum-binary-tree-ii/export.go

@@ -0,0 +1,5 @@
+package index
+
+func InsertIntoMaxTree(root *TreeNode, val int) *TreeNode {
+	return insertIntoMaxTree(root, val)
+}

maximum-binary-tree-ii/go.mod

@@ -0,0 +1,7 @@
+module github.com/masx200/leetcode-test/maximum-binary-tree-ii
+
+go 1.19
+
+require github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree v0.0.0
+
+replace github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree v0.0.0 => ../serialize-and-deserialize-binary-tree

maximum-binary-tree-ii/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=

maximum-binary-tree-ii/index.go

@@ -0,0 +1,15 @@
+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 insertIntoMaxTree(root *TreeNode, val int) *TreeNode {
+	if root == nil || root.Val < val {
+		return &TreeNode{Val: val, Left: root}
+
+	}
+
+	root.Right = insertIntoMaxTree(root.Right, val)
+	return root
+}

maximum-binary-tree/export.go

@@ -0,0 +1,5 @@
+package index
+
+func ConstructMaximumBinaryTree(nums []int) *TreeNode {
+	return constructMaximumBinaryTree(nums)
+}

maximum-binary-tree/go.mod

@@ -0,0 +1,11 @@
+module github.com/masx200/leetcode-test/maximum-binary-tree
+
+go 1.19
+
+require github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree v0.0.0
+
+require github.com/masx200/leetcode-test/maximum-binary-tree-ii v0.0.0
+
+replace github.com/masx200/leetcode-test/maximum-binary-tree-ii v0.0.0 => ../maximum-binary-tree-ii
+
+replace github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree v0.0.0 => ../serialize-and-deserialize-binary-tree

maximum-binary-tree/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=

maximum-binary-tree/index.go

@@ -0,0 +1,16 @@
+package index
+
+import maximum_binary_tree_ii "github.com/masx200/leetcode-test/maximum-binary-tree-ii"
+import serialize_and_deserialize_binary_tree "github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree"
+
+type TreeNode = serialize_and_deserialize_binary_tree.TreeNode
+
+var insertIntoMaxTree = maximum_binary_tree_ii.InsertIntoMaxTree
+
+func constructMaximumBinaryTree(nums []int) *TreeNode {
+	var node *TreeNode = nil
+	for _, v := range nums {
+		node = insertIntoMaxTree(node, v)
+	}
+	return node
+}