Open In App
Related Articles

Scala TreeSet dropRight() method with example

Improve Article
Improve
Save Article
Save
Like Article
Like

In Scala TreeSet class, the dropRight() method is utilized to drop the last ā€˜nā€™ elements of the TreeSet.

Method Definition: def dropRight(n: Int): TreeSet[A]

Return Type: It returns a new TreeSet that consists of all the elements except the last ā€˜nā€™ elements.

Example #1:




// Scala program of dropRight() 
// method 
  
// Import TreeSet
import scala.collection.mutable._
  
// Creating object 
object GfG 
  
    // Main method 
    def main(args:Array[String]) 
    
      
        // Creating TreeSet
        val t1 = TreeSet(2, 4, 6, 7, 8, 9
          
        // Print the TreeSet
        println(t1
          
        // Applying dropRight() method  
        val result = t1.dropRight(2)
          
        // Displays output 
        println("Queue after using dropRight(2) method: " + result)
          
    


Output:

TreeSet(2, 4, 6, 7, 8, 9)
Queue after using dropRight(2) method: TreeSet(2, 4, 6, 7)

Example #2:




// Scala program of dropRight() 
// method 
  
// Import TreeSet
import scala.collection.mutable._
  
// Creating object 
object GfG 
  
    // Main method 
    def main(args:Array[String]) 
    
      
        // Creating TreeSet
        val t1 = TreeSet(2, 4, 6, 7, 8, 9
          
        // Print the TreeSet
        println(t1
          
        // Applying dropRight() method  
        val result = t1.dropRight(4)
          
        // Displays output 
        println("Queue after using dropRight(4) method: " + result)
          
    


Output:

TreeSet(2, 4, 6, 7, 8, 9)
Queue after using dropRight(4) method: TreeSet(2, 4)

Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!

Last Updated : 02 Nov, 2019
Like Article
Save Article
Similar Reads