Scala TreeSet dropRight() method with example

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:

filter_none

edit
close

play_arrow

link
brightness_4
code

// 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)
          
    

chevron_right


Output:

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

Example #2:

filter_none

edit
close

play_arrow

link
brightness_4
code

// 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)
          
    

chevron_right


Output:

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



My Personal Notes arrow_drop_up

Coder Machine Learner Social Activist Vocalist

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.