99 Elm Problems/Problem 59

From Wikibooks, open books for an open world
Jump to navigation Jump to search

Construct a height ­balanced binary trees, such that the difference in height between the left and right subtrees at each node is not greater than one.

# # # THIS IS A STUB # # #

Example in Elm:
import Html exposing (text)
import List

f : Int -> Int
-- your implementation goes here

main = text (toString (f 0))