Day 1 Linked List

本文主要是介绍Day 1 Linked List，对大家解决编程问题具有一定的参考价值，需要的程序猿们随着小编来一起学习吧！

Linked List is composed of a series of nodes.

The list is terminated when a node's link is null. The last node in this linked list is called the 'tailed node'. Respectively, the first node is called the 'head node'.

Since the nodes use links to denote the next node in the sequence, the nodes are not required to be sequentially located in the momery. These links also allow for quick insertion and removal of nodes. 

Common operations on a linked list may include:

• adding nodes
• removing nodes
• finding a node
• traversing (or traveling through) the linked list

Linked list needs some maintanance in order to add or remove nodes. 

这篇关于Day 1 Linked List的文章就介绍到这儿，希望我们推荐的文章对大家有所帮助，也希望大家多多支持为之网！