Go lang 으로 Binary Tree 만든 코드

package golangleetcode

import (
‌"fmt"
‌"testing"
)

type Number interface {
‌int | float32 | float64
}

type Node[T Number] struct {
‌Val       T
‌LeftNode  *Node[T]
‌RightNode *Node[T]
}

func (node *Node[T]) Left() *Node[T] {
‌return node.LeftNode
}

func (node *Node[T]) Right() *Node[T] {
‌return node.RightNode
}

func (selfNode *Node[T]) AddNode(node *Node[T]) {
‌if selfNode.Val > node.Val {
‌‌if selfNode.LeftNode == nil {
‌‌‌selfNode.LeftNode = node
‌‌}
‌‌if selfNode.LeftNode != nil {
‌‌‌selfNode.LeftNode.AddNode(node)
‌‌}
‌}

‌if selfNode.Val < node.Val {
‌‌if selfNode.RightNode == nil {
‌‌‌selfNode.RightNode = node
‌‌}
‌‌if selfNode.RightNode != nil {
‌‌‌selfNode.RightNode.AddNode(node)
‌‌}
‌}
}

func NewNode[T Number](value T) *Node[T] {
‌return &Node[T]{Val: value, LeftNode: nil, RightNode: nil}
}

func (node *Node[T]) Print(depth int) {

‌fmt.Println("Self : ", node.Val, " Depth : ", depth)

‌depth++

‌if node.LeftNode != nil {
‌‌fmt.Println("Left Node Value : ", node.LeftNode.Val, " Depth : ", depth)
‌‌node.LeftNode.Print(depth)
‌}

‌if node.RightNode != nil {
‌‌fmt.Println("Right Node Value : ", node.RightNode.Val, " Depth : ", depth)
‌‌node.RightNode.Print(depth)
‌}

}

// Search Target in Tree
// Return Depth of Target
// Time Complexity : O(logN)
// Space Complexity: O(logN)
func (node *Node[T]) BinarySearch(target T, depth int) (d int, isExist bool) {
‌depth++

‌if target == node.Val {
‌‌fmt.Println("Target : ", target, " Cur : ", node.Val)
‌‌return depth, true
‌}

‌if target > node.Val {
‌‌return node.RightNode.BinarySearch(target, depth)
‌}

‌if target < node.Val {
‌‌return node.LeftNode.BinarySearch(target, depth)
‌}

‌return -1, false
}

func TestNode(t *testing.T) {
‌node1 := NewNode(5)
‌node2 := NewNode(2)
‌node3 := NewNode(3)
‌node4 := NewNode(4)
‌node5 := NewNode(1)
‌node6 := NewNode(6)
‌node7 := NewNode(7)

‌node1.AddNode(node2)
‌node1.AddNode(node3)
‌node1.AddNode(node4)
‌node1.AddNode(node5)
‌node1.AddNode(node6)
‌node1.AddNode(node7)

‌node1.Print(0)

}

func TestBinarySearch(t *testing.T) {
‌node1 := NewNode(5)
‌node2 := NewNode(2)
‌node3 := NewNode(3)
‌node4 := NewNode(4)
‌node5 := NewNode(1)
‌node6 := NewNode(6)
‌node7 := NewNode(7)

‌node1.AddNode(node2)
‌node1.AddNode(node3)
‌node1.AddNode(node4)
‌node1.AddNode(node5)
‌node1.AddNode(node6)
‌node1.AddNode(node7)

‌depth, isExist := node1.BinarySearch(7, 0)

‌fmt.Println("Depth : ", depth, " isExist : ", isExist)

‌if depth != 2 && isExist != true {
‌‌t.Errorf("[Error] 7 is must be exist in Current Tree!")
‌}
}