O'Reilly logo

Learning Functional Data Structures and Algorithms by Raju Kumar Mishra, Atul Khot

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Summary

Trees are a hierarchical data structure with notions of root, parent, children, and leaf nodes. Binary trees are trees where each parent node can have a maximum of two children nodes, each of which could be a binary tree itself.

Binary trees are recursively defined data structures like List.

We defined the various types of nodes of a binary tree. We also implemented a number of related functional algorithms.

We used Binary Search Trees for implementing dictionaries. We learned about some Scala idioms too.

All of this know-how arms us well to look at more fascinating functional data structures. On to it!

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required