🎓 Top 15 Udemy Courses (80-90% Discount): My Udemy Courses - Ramesh Fadatare — All my Udemy courses are real-time and project oriented courses.
▶️ Subscribe to My YouTube Channel (178K+ subscribers): Java Guides on YouTube
▶️ For AI, ChatGPT, Web, Tech, and Generative AI, subscribe to another channel: Ramesh Fadatare on YouTube
1. Introduction
In this tutorial, we will learn how to implement a simple Queue data structure using Kotlin programming language.Queue is a fundamental data structure that operates based on the First In, First Out (FIFO) principle. This means the first element added to the queue will be the first element to come out from it. Common operations associated with a queue include enqueue, dequeue, and peek.
2. Implementation Steps
1. Define a class named Queue.
2. Initialize an empty list to store the queue elements.
3. Implement the enqueue method to add elements to the queue.
4. Implement the dequeue method to remove the front element from the queue.
5. Implement the peek method to view the front element without removing it.
6. Implement an isEmpty method to check if the queue is empty.
3. Implementation in Kotlin Programming
class Queue<T> {
private val elements: MutableList<T> = mutableListOf()
// 3. Implement the `enqueue` method
fun enqueue(item: T) {
elements.add(item)
}
// 4. Implement the `dequeue` method
fun dequeue(): T? {
if (isEmpty()) {
return null
}
return elements.removeAt(0)
}
// 5. Implement the `peek` method
fun peek(): T? {
return elements.firstOrNull()
}
// 6. Implement the `isEmpty` method
fun isEmpty() = elements.isEmpty()
}
// Client code to demonstrate the queue functionality
val queue = Queue<Int>()
queue.enqueue(1)
queue.enqueue(2)
queue.enqueue(3)
println(queue.peek()) // Expected Output: 1
println(queue.dequeue()) // Expected Output: 1
println(queue.peek()) // Expected Output: 2
Output:
1 1 2
Explanation:
1. A Queue class is defined with type parameter T to make it generic.
2. Inside the class, a mutable list named elements is initialized. This list holds the queue elements.
3. The enqueue method takes an item of type T and adds it to the end of the elements list.
4. The dequeue method removes and returns the first item from the elements list. If the queue is empty, it returns null.
5. The peek method returns the first item from the elements list without removing it. If the queue is empty, it returns null.
6. The isEmpty method checks if the elements list is empty and returns a boolean value.
My Top and Bestseller Udemy Courses. The sale is going on with a 70 - 80% discount. The discount coupon has been added to each course below:
Build REST APIs with Spring Boot 4, Spring Security 7, and JWT
![[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25](https://img-c.udemycdn.com/course/750x422/6852721_b512_2.jpg "[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25")
[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25
ChatGPT + Generative AI + Prompt Engineering for Beginners
Spring 7 and Spring Boot 4 for Beginners (Includes 8 Projects)
Available in Udemy for Business
Building Real-Time REST APIs with Spring Boot - Blog App
Available in Udemy for Business
Building Microservices with Spring Boot and Spring Cloud
Available in Udemy for Business
Java Full-Stack Developer Course with Spring Boot and React JS
Available in Udemy for Business
Build 5 Spring Boot Projects with Java: Line-by-Line Coding
Testing Spring Boot Application with JUnit and Mockito
Available in Udemy for Business
Spring Boot Thymeleaf Real-Time Web Application - Blog App
Available in Udemy for Business
Master Spring Data JPA with Hibernate
Available in Udemy for Business
Spring Boot + Apache Kafka Course - The Practical Guide
Available in Udemy for Business
Comments
Post a Comment
Leave Comment