Write a method called deleteMultipleNodes to be included in the class KWLinkedList (class for doubly linked list). The method has two parameters count of type int and direction of type char. The count is the number of nodes to be deleted in the specified direction. The direction can be either ‘f’ or ‘b’. The method returns false, if the list is empty or the number of nodes in the list is less than count. The method checks the direction, if direction is ‘f’, the method removes count number of nodes in the forward direction, otherwise, the method removes count number of nodes in the backward direction, and returns true.NOTE: You can use ListIterator and its methods. Example 1:Before run: head tail list: 20 50 70 90 33 89 count: 2 direction: ’f’After run: head tail list: 70 90 33 89 Example 2:Before run: head tail list: 20 50 70 90 33 89 count: 2 direction: ’b’After run: head tail list: 20 50 70 90 Method heading:public boolean deleteMultipleNodes(int count, char direction){ Write a method called deleteMultipleNodes to be included in the classKWLinkedList (class for doubly linked list). The method has two parameters count oftype int and direction of type char. The count is the number of nodes to be deletedin the specified direction. The direction can be either f or 'b'. The method returnsfalse, if the list is empty or the number of nodes in the list is less than count. The methodchecks the direction, if direction is 'f', the method removes count number of nodes inthe forward direction, otherwise, the method removes count number of nodes in thebackward direction, and returns true.NOTE: You can use ListIterator and its methods.Example 1:Before run:After run:headtailheadtaillist: 20 5070 90 3389list: 70 903389count: 2direction: 'fExample 2:Before run:After run:headtailheadtaillist: 20 5070 903389list: 20 5070 90count: 2direction: 'b'Method heading:public boolean deleteMultipleNodes (int count, char direction){

Note: head represent Head of List and tail represent Tail of list void deleteMultipleNodes (int…

Answered: if direction is ‘f’, the method removes…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Write a method called deleteMultipleNodes to be included in the class KWLinkedList (class for doubly linked list). The method has two parameters count of type int and direction of type char. The count is the number of nodes to be deleted in the specified direction. The direction can be either ‘f’ or ‘b’. The method returns false, if the list is empty or the number of nodes in the list is less than count. The method checks the direction, if direction is ‘f’, the method removes count number of nodes in the forward direction, otherwise, the method removes count number of nodes in the backward direction, and returns true.

NOTE: You can use ListIterator and its methods.

Example 1:

Before run:

head tail

list: 20 50 70 90 33 89

count: 2 direction: ’f’

After run:

head tail

list: 70 90 33 89

Example 2:

Before run:

head tail

list: 20 50 70 90 33 89

count: 2 direction: ’b’

After run:

head tail

list: 20 50 70 90

Method heading:

public boolean deleteMultipleNodes(int count, char direction)

{

Write a method called deleteMultipleNodes to be included in the class
KWLinkedList (class for doubly linked list). The method has two parameters count of
type int and direction of type char. The count is the number of nodes to be deleted
in the specified direction. The direction can be either f or 'b'. The method returns
false, if the list is empty or the number of nodes in the list is less than count. The method
checks the direction, if direction is 'f', the method removes count number of nodes in
the forward direction, otherwise, the method removes count number of nodes in the
backward direction, and returns true.
NOTE: You can use ListIterator and its methods.
Example 1:
Before run:
After run:
head
tail
head
tail
list: 20 50
70 90 33
89
list: 70 90
33
89
count: 2
direction: 'f
Example 2:
Before run:
After run:
head
tail
head
tail
list: 20 50
70 90
33
89
list: 20 50
70 90
count: 2
direction: 'b'
Method heading:
public boolean deleteMultipleNodes (int count, char direction)
{

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions