root
/
public
mirror of https://github.com/01-edu/public.git
14
27
Fork 0
Code Releases Wiki Activity
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.
2593 Commits
90 Branches
11 Tags
349 MiB
 
 
 
 
 
 
Tree: 5cb87eb4a4
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '5cb87eb4a4'
${ noResults }
public/subjects/btreelevelcount
xpetit e160f65471
Remove relative imports (no longer works with modules) and remove invalid character (" ") 		4 years ago
..
README.md Remove relative imports (no longer works with modules) and remove invalid character (" ") 4 years ago

README.md

btreelevelcount

Instructions

Write a function, BTreeLevelCount, that returns the number of levels of the binary tree (height of the tree)

Expected function

func BTreeLevelCount(root *TreeNode) int {

}

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

And its output :

$ go run .
3
$