Describe the feature
Implement utility functions to interact with and view the list: display_list(Node* head), search_element(Node* head, int key), and get_length(Node* head).
It should be implemented because
These functions provide the necessary "Read" operations. Specifically, display_list is the most common way for students to visualize how the circular structure differs from a linear one.
Additional context
Goal:
Enable data visualization and querying within the circle.
Files to Modify:
- CLL/cll.h: Add function prototypes for utilities.
- CLL/cll.c: Implement the traversal logic.
Specific Task:
display_list MUST use a do-while loop to ensure the list is traversed exactly once without causing an infinite loop.
Dependency:
I- ssue #2 (Insertion Logic).
- The display_list output should ideally show a visual indicator that the last node points back to the head (e.g., [data] -> [head]).
Would you like to work on this issue?
None
Describe the feature
Implement utility functions to interact with and view the list: display_list(Node* head), search_element(Node* head, int key), and get_length(Node* head).
It should be implemented because
These functions provide the necessary "Read" operations. Specifically, display_list is the most common way for students to visualize how the circular structure differs from a linear one.
Additional context
Goal:
Enable data visualization and querying within the circle.
Files to Modify:
Specific Task:
Dependency:
I- ssue #2 (Insertion Logic).
Would you like to work on this issue?
None