99 Elm Problems/Problem 59

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:

Result:

Solutions