exercism fetch fsharp zipper


Creating a zipper for a binary tree.

Zippers are a way purely functional of navigating within a data structure and manipulating it. They essentially contain a data structure and a pointer into that data structure (called the focus).

For example given a rose tree (where each node contains a value and a list of child nodes) a zipper might support these operations:

Submitting Incomplete Solutions

It's possible to submit an incomplete solution so you can see how others have completed the exercise.