Linked list Practice Questions

Duration: 1 min

This video lesson is available to enrolled students.

Return to /learn/CODING-FOR-PLACEMENT/data-structure/linked-list/structure-modification-pointer-logic/asset-linked-list-practice-questions after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. C: C Programming by Yash Sir
  2. C++: Programming in C++
  3. Java: Java
  4. Python: Python for Placements by Yash Sir
  5. OOPs Concept: Object Oriented Programming (OOPS)
  6. Pseudo Code: Pseudo Codes
  7. Data Structure: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithm: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  9. DSA Implementation: DSA using Python
  10. Competitive Coding: Coding Questions by Yash Sir, Coding Questions Bank
  11. Mega Test:
  12. Grand Test:
  13. Live Class Notes: Placement Live Classes
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a C programming problem involving a recursive function operating on a linked list. The linked list is defined as 1->2->3->4->5->6. The function fun takes a pointer to a node. The instructor analyzes the code line by line. First, he identifies the base case if(start == NULL) return;. Then he notes the initial print statement printf("%d ", start->data);. The core logic lies in the recursive call fun(start->next->next), which advances the pointer by two nodes instead of one. He draws a diagram on the screen to trace the execution flow. The recursion proceeds: Node 1 calls Node 3, Node 3 calls Node 5, and Node 5 calls NULL. Once the base case is hit, the function returns, and the subsequent print statements execute in reverse order of the calls. This results in the sequence 1, 3, 5 being printed during the descent, and 5, 3, 1 being printed during the ascent. The final output is 1 3 5 5 3 1, which corresponds to option (D).

Chapters

  1. 0:00 – 1:14 00:00-01:14

    The instructor introduces the problem statement displayed on screen: "Q What is the output of following function for start pointing to first node of following linked list? 1->2->3->4->5->6". He reads the C code void fun(struct node* start) and points out the initial print statement printf("%d ", start->data);.

The lecture demonstrates how to trace recursive functions on data structures. By breaking down the code into base cases and recursive steps, and visualizing the call stack, the instructor shows how to predict the output of complex logic involving pointer manipulation.

Loading lesson…