You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

1021 B

btreeinsertdata

Instructions

Write a function that inserts new data in a binary search tree following the properties of binary search trees. The nodes must be defined as follows:

Expected function

type TreeNode struct {
	Left, Right, Parent *TreeNode
	Data                 string
}

func BTreeInsertData(root *TreeNode, data string) *TreeNode {

}

Usage

Here is a possible program to test your function :

package main

import (
    "fmt"
    piscine ".."
)

func main() {
     root := &piscine.TreeNode{data: "4"}
     piscine.BTreeInsertData(root, "1")
     piscine.BTreeInsertData(root, "7")
     piscine.BTreeInsertData(root, "5")
     fmt.Println(root.left.data)
     fmt.Println(root.data)
     fmt.Println(root.right.left.data)
     fmt.Println(root.right.data)

}

And its output :

student@ubuntu:~/piscine/btreeinsertdata$ go build
student@ubuntu:~/piscine/btreeinsertdata$ ./btreeinsertdata
1
4
5
7
student@ubuntu:~/piscine/btreeinsertdata$