adding clean inserting

Author: BaseMax

CompleteTree.go

@@ -0,0 +1,125 @@
+/**
+ *
+ * @Name: Complete Tree Implementation in Go By Linked List
+ * @Author: Max Base
+ * @Repository: https://github.com/BaseMax/CompleteTreeLinkedListGo
+ * @License: GPL-3.0
+ * @Date: 2022/12/24
+ *
+ **/
+
+package main
+
+type Node struct {
+	value int
+	left  *Node
+	right *Node
+}
+
+type CompleteTree struct {
+	root *Node
+}
+
+/**
+ * build a complete tree
+ */
+func NewCompleteTree() *CompleteTree {
+	return &CompleteTree{}
+}
+
+/**
+ * insert a new node to complete tree
+ */
+func (h *CompleteTree) Insert(value int) {
+	if h.root == nil {
+		h.root = &Node{value: value}
+		return
+	}
+
+	h.insert(h.root, value)
+}
+
+func (h *CompleteTree) insert(n *Node, value int) {
+	if n.left == nil {
+		n.left = &Node{value: value}
+		return
+	}
+
+	if n.right == nil {
+		n.right = &Node{value: value}
+		return
+	}
+
+	h.insert(n.left, value)
+}
+
+/**
+ * insert a new node to complete tree by filling from left to right (per row)
+ */
+func (h *CompleteTree) InsertClean(value int) {
+	if h.root == nil {
+		h.root = &Node{value: value}
+		return
+	}
+
+	h.insertClean(h.root, value)
+}
+func (h *CompleteTree) insertClean(n *Node, value int) {
+	if n.left == nil {
+		n.left = &Node{value: value}
+		return
+	}
+
+	if n.right == nil {
+		n.right = &Node{value: value}
+		return
+	}
+
+	h.insertClean(n.left, value)
+	if n.left != nil {
+		h.insertClean(n.right, value)
+	}
+}
+
+/**
+ * print complete tree
+ */
+func (h *CompleteTree) Print() {
+	// print the complete tree by using ASCII art
+	h.print(h.root, 0)
+}
+func (h *CompleteTree) print(n *Node, level int) {
+	if n == nil {
+		return
+	}
+
+	h.print(n.right, level+1)
+
+	for i := 0; i < level; i++ {
+		print("    ")
+	}
+
+	print(n.value)
+	print("  ")
+	print(" ")
+	print("\n")
+
+	h.print(n.left, level+1)
+}
+
+func main() {
+	// Create a new complete tree
+	CompleteTree := NewCompleteTree()
+
+	// Insert some values
+	CompleteTree.Insert(1)
+	CompleteTree.Insert(2)
+	CompleteTree.Insert(3)
+	CompleteTree.Insert(4)
+	CompleteTree.Insert(5)
+	CompleteTree.Insert(6)
+	CompleteTree.Insert(7)
+	CompleteTree.Insert(8)
+	CompleteTree.Insert(9)
+	CompleteTree.Insert(10)
+}

HeapTree.go

@@ -1,12 +1,10 @@
-# Heap Tree Linked List (Go)
+# Complete Tree Linked List (Go)
 
-This is a simple Go program based on Linked List and by using it you can easily insert your nodes to the heap tree without worring about it to not be a heap tree. This program will automatically fix the heap tree for you and you are sure that your heap tree is always a heap tree.
 
-Heap Tree Go is a Go implementation of a heap tree. It is a binary tree where the parent node is always greater than or equal to its children. It is a complete binary tree, meaning that all levels of the tree are fully filled except for possibly the last level. The last level is filled from left to right.
 
 ## Using
 
-In the following we will create an empty Heap tree and add some values to it.
+In the following we will create an empty **Complete Tree** and add some values to it.
 
 Finally we will print the heap tree.
 
@@ -45,4 +43,6 @@ The output of above code will be:
                     10
 ```
 
+
+
 Copyright (c) 2022, Max Base

README.md

@@ -1,3 +1,3 @@
-module github.com/BaseMax/HeapTreeGo
+module github.com/BaseMax/CompleteTree
 
 go 1.19