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

Comparing trees

How do we compare two trees to know whether they are equal or not? Note that the trees could have the same values but could differ structurally.

Comparing trees

The diagram shows two complete binary trees. However, as shown, these two are not equal.

To check this, we need to traverse both the trees at the same time. How could we perform this traversal? Of course, we do this using a tuple match:

 scala> def equal[A](tree1: BinTree[A], tree2: BinTree[A]): Boolean = (tree1, | tree2) match { | case (Leaf, Leaf) => true | case (Branch(v1, l1, r1), Branch(v2, l2, r2)) if v1 == v2 => | equal(l1, l2) && equal(r1, r2) | case _ => false | } scala> val tree1 ...

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