You're reading from Learning Functional Data Structures and Algorithms Learn functional data structures and algorithms for your applications and bring their benefits to your work now

Product type Paperback

Published in Feb 2017

Publisher Packt

ISBN-13 9781785888731

Length 318 pages

Edition 1st Edition

Languages

Scala

Concepts

Data Structures and Algorithms

Authors (2):

S. Khot

Mishra

View More author details

Table of Contents (14) Chapters

Preface

1. Why Functional Programming? FREE CHAPTER

2. Building Blocks

3. Lists

4. Binary Trees

5. More List Algorithms

6. Graph Algorithms

7. Random Access Lists

8. Queues

9. Streams, Laziness, and Algorithms

10. Being Lazy - Queues and Deques

11. Red-Black Trees

12. Binomial Heaps

13. Sorting

Node definitions

Similar to lists, our binary tree is a trait, BinTree[+A]:

sealed trait BinTree[+A] 
case object Leaf extends BinTree[Nothing] 
case class Branch[A](value: A, left: BinTree[A], right: BinTree[A]) extends BinTree[A]

The sealed trait BinTree[+A] array defines a sealed trait. As it is sealed, we can extend it only in the same source file. We saw in Chapter 3, Lists how this helps the compiler to check for exhaustive pattern matching:

case object Leaf extends BinTree[Nothing]

The Leaf node is a terminator node, just like we have the Nil node in lists. Just like Nil, Leaf is a case object, as we just need only one instance of it:

case class Branch[A](value: A, left: BinTree[A], right: BinTree[A]) extends BinTree[A]

The Branch node holds a value, of type A, and a left and right subtree. These subtrees could be either branches or leaves.

Thus, we define the binary tree in terms of itself; in other words, it is a recursively defined structure, similar to List:

Note

Note that this...

The rest of the chapter is locked

A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.

Unlock this book and the full library FREE for 7 days

Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of

Start free trial

Renews at €18.99/month. Cancel anytime

Authors (2)

S. Khot

Atul S. Khot is a self-taught programmer and has written software programmes in C and C++. Having extensively programmed in Java and dabbled in multiple languages, these days, he is increasingly getting hooked on Scala, Clojure, and Erlang. Atul is a frequent speaker at software conferences and a past Dr. Dobb's product award judge. He was the author of Scala Functional Programming Patterns and Learning Functional Data Structures and Algorithms, published by Packt Publishing.

See other products by S. Khot

Mishra

Raju Kumar Mishra is a consultant and corporate trainer for big data and programming. After completing his B. Tech from the Indian Institute of Technology (ISM) Dhanbad, he worked for Tata Steel. His deep passion for mathematics, data science, and programming took him to the Institute of Science (IISc). After graduating from IISc in computational science, he worked for Oracle as a performance engineer and software developer. He is an Oracle-certified associate for Java 7. He is a Hortonworks-certified Apache Hadoop Java developer, and holds a Developer Certification for Apache Spark (O'Reilly School of Technology and Databriks), and Revolution R Enterprise-certified Specialist Certifications. As well as this, he has also passed the Financial Risk Manager (FRM I) exam. His interest in mathematics helped him in clearing the CT3 (Actuarial Science) exam.

See other products by Mishra