adplus-dvertising
frame-decoration

Question

Which of the following can be the base case for the recursive implementation used to find the length of linked list?

a.

if(current_node == 0) return 1

b.

if(current_node->next == 0) return 1

c.

if(current_node->next == 0) return 0

d.

if(current_node == 0) return 0

Posted under Data Structures and Algorithms

Answer: (d).if(current_node == 0) return 0

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the following can be the base case for the recursive implementation used to find the length of linked list?
Add Comment

Similar Questions

Discover Related MCQs

Q. Which of the following can be the base case for the recursive implementation used to find the length of a string?

View solution

Q. What is the time complexity of the above recursive implementation used to find the length of the string?

View solution

Q. Which of the following methods can be used to find the largest and smallest element in an array?

View solution

Q. What is the time complexity of the above iterative implementation used to find the largest and smallest element in an array?

View solution

Q. What is the time complexity of the above recursive implementation used to find the largest and the smallest element in an array?

View solution

Q. Which of the following methods can be used to find the largest and smallest number in a linked list?

View solution

Q. What is the time complexity of the above iterative code used to find the smallest and largest element in a linked list?

View solution

Q. What is the time complexity of the recursive implementation used to find the largest and smallest element in a linked list?

View solution

Q. Which of the following techniques can be used to search an element in an unsorted array?

View solution

Q. Consider the array {1,1,1,1,1}:
Which of the following techniques can be used to search an element in the above array?

View solution

Q. What is the time complexity of the above recursive implementation of linear search?

View solution

Q. Which of the following methods can be used to search an element in a linked list?

View solution

Q. What is the time complexity of the above implementation of linear search on a linked list?

View solution

Q. Can binary search be applied on a sorted linked list in O(Logn) time?

View solution

Q. What will be time complexity when binary search is applied on a linked list?

View solution
View All MCQs on Data Structures and Algorithms

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Software Engineering

Learn about the systematic approach to developing software with our Software...

Reverse Engineering

Strengthen your understanding of Reverse Engineering with our curated set of MCQs....

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

Wireless and Mobile Communications

Get to grips with modern communication technologies with our Wireless and Mobile...

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...

Digital Logic Design

Understand the foundation of digital computers with our Digital Logic Design MCQs....

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...