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.
 
 
 
 
 
 

737 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

func BTreeIsBinary(root *TreeNode) bool {

}

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(piscine.BTreeIsBinary(root))
}

And its output :

student@ubuntu:~/btreeisbinary/test$ go build
student@ubuntu:~/btreeisbinary/test$ ./test
true
student@ubuntu:~/btreeisbinary/test$