Skip to content

Instantly share code, notes, and snippets.

@adilakhter

adilakhter/BinaryTree.scala

Last active August 29, 2015 14:23
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save adilakhter/621a8118323371039c47 to your computer and use it in GitHub Desktop.
Save adilakhter/621a8118323371039c47 to your computer and use it in GitHub Desktop.
Download ZIP
`map` using fold
Raw
BinaryTree.scala
import Tree._
def map[A,B](tree: Tree[A])(f: A => B): Tree[B] =
fold(tree, Tree.empty[B]){(l, x, r) => Node(f(x), l,r)}
scala> map (t1) ( x => x * 10)
res11: Tree[Int] =
Node(40,
Node(20,
Node(10,EmptyTree,EmptyTree),
Node(30,EmptyTree,EmptyTree)),
Node(70,
Node(60,EmptyTree,EmptyTree),
Node(90,EmptyTree,EmptyTree)))
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment