99 Elm Problems/Problem 55
Jump to navigation Jump to search
Construct completely balanced binary trees, that is, the difference of the number of nodes in its left and right subtrees 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))