forked from root/public
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.
58 lines
975 B
58 lines
975 B
5 years ago
|
## btreeinsertdata
|
||
5 years ago
|
|
||
5 years ago
|
### Instructions
|
||
5 years ago
|
|
||
![]()
5 years ago
|
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 :
|
||
5 years ago
|
|
||
5 years ago
|
### Expected function
|
||
5 years ago
|
|
||
|
```go
|
||
|
type TreeNode struct {
|
||
5 years ago
|
Left, Right, Parent *TreeNode
|
||
|
Data string
|
||
5 years ago
|
}
|
||
|
|
||
|
func BTreeInsertData(root *TreeNode, data string) *TreeNode {
|
||
|
|
||
|
}
|
||
|
```
|
||
|
|
||
5 years ago
|
### Usage
|
||
5 years ago
|
|
||
5 years ago
|
Here is a possible program to test your function :
|
||
5 years ago
|
|
||
|
```go
|
||
|
package main
|
||
|
|
||
5 years ago
|
import (
|
||
5 years ago
|
"fmt"
|
||
|
piscine ".."
|
||
5 years ago
|
)
|
||
|
|
||
5 years ago
|
func main() {
|
||
5 years ago
|
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)
|
||
5 years ago
|
|
||
|
}
|
||
|
```
|
||
|
|
||
|
And its output :
|
||
|
|
||
|
```console
|
||
5 years ago
|
student@ubuntu:~/[[ROOT]]/btreeinsertdata$ go build
|
||
|
student@ubuntu:~/[[ROOT]]/btreeinsertdata$ ./btreeinsertdata
|
||
5 years ago
|
1
|
||
|
4
|
||
|
5
|
||
|
7
|
||
5 years ago
|
student@ubuntu:~/[[ROOT]]/btreeinsertdata$
|
||
5 years ago
|
```
|