Introduction

• It contains not only the value but also a reference field to link to next node
• It can move only one direction
• Insert operation needs only O(1) time complexity
• head node represents a whole list, so it’s essential to update head when adding a new node at the beginning of the list
• Delete operation needs O(N) time complexity

You Will Know

• topic1

Why Should You Learn These

Contents

Click cmd/ctrl + option/alt + T to expand all toggles

1. Characters

2. Implementation

3. Two Pointer Technique

4. Sentinel Node

Conclusions

References

• link1

Further Readings

• a further reading for topic 1

Note