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.

43 lines
623 B

## btreeisbinary
### Instructions
Write a function, `BTreeIsBinary`, that returns `true` only if the tree given by `root` follows the binary search tree properties.
### Expected function
```go
func BTreeIsBinary(root *TreeNode) bool {
}
```
### Usage
Here is a possible program to test your function :
```go
package main
import (
5 years ago
"fmt"
piscine ".."
)
func main() {
root := &piscine.TreeNode{Data: "4"}
piscine.BTreeInsertData(root, "1")
piscine.BTreeInsertData(root, "7")
piscine.BTreeInsertData(root, "5")
fmt.Println(piscine.BTreeIsBinary(root))
}
```
And its output :
```console
$ go run .
true
$
```