99 Elm Problems/Problem 62
Jump to navigation Jump to search
62.a) Collect the internal nodes of a binary tree in a list, that is all nodes that have at least one successor node.
62.b) Collect the nodes at a given level in a list.
# # # 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))