Scala TreeSet intersect() method with example

In Scala TreeSet class, the intersect() method is utilized to return a new TreeSet that consists of elements that are present in both the given TreeSet.

Method Definition: def intersect[B >: A](that: collection.Seq[B]): TreeSet[A]

Return Type: It returns a new TreeSet that consists of elements that are present in both the given TreeSet.

Example #1:

// Scala program of intersect()
// method

// Import TreeSet
import scala.collection.mutable._

// Creating object
object GfG
{

    // Main method
    def main(args:Array[String])
    {

        // Creating TreeSets
        val t1 = TreeSet(1, 3, 2, 7, 6, 5)

        val t2 = TreeSet(11, 3, 12, 7, 16, 5)

        // Print the TreeSets
        println("t1: " + t1)

        println("t2: " + t2)

        // Applying intersect() method
        val result = t1.intersect(t2)

        // Displays output
        println("TreeSet with common elements: " + result)

    }
}

Output:

t1: TreeSet(1, 2, 3, 5, 6, 7)
t2: TreeSet(3, 5, 7, 11, 12, 16)
TreeSet with common elements: TreeSet(3, 5, 7)

Example #2:

// Scala program of intersect()
// method

// Import TreeSet
import scala.collection.mutable._

// Creating object
object GfG
{

    // Main method
    def main(args:Array[String])
    {

        // Creating TreeSets
        val t1 = TreeSet(1, 3, 2, 7, 6, 5)

        val t2 = TreeSet(1, 13, 2, 17, 16, 5)

        // Print the TreeSets
        println("t1: " + t1)

        println("t2: " + t2)

        // Applying intersect() method
        val result = t1.intersect(t2)

        // Displays output
        println("TreeSet with common elements: " + result)

    }
}

Output:

t1: TreeSet(1, 2, 3, 5, 6, 7)
t2: TreeSet(1, 2, 5, 13, 16, 17)
TreeSet with common elements: TreeSet(1, 2, 5)