一,单向链表的实现
1. node【节点的实现】
![2015574-722cabc020057582.png](https://upload-images.jianshu.io/upload_images/2015574-722cabc020057582.png)
node的实现
singlelinkedlist 的实现
![2015574-3a1484d69356ef7c.png](https://upload-images.jianshu.io/upload_images/2015574-3a1484d69356ef7c.png)
singlelinkedlist 的实现
检查链表是否为空
![2015574-f6d273deb103edd9.png](https://upload-images.jianshu.io/upload_images/2015574-f6d273deb103edd9.png)
判断是否为空
在链表前段添加元素
![2015574-fe8c226b85282c1d.png](https://upload-images.jianshu.io/upload_images/2015574-fe8c226b85282c1d.png)
链表前段添加元素
append 尾部添加元素
![2015574-d37e201b5712b656.png](https://upload-images.jianshu.io/upload_images/2015574-d37e201b5712b656.png)
append
search 链表中的元素
![2015574-ac920e7c3b826c49.png](https://upload-images.jianshu.io/upload_images/2015574-ac920e7c3b826c49.png)
元素在链表中search 链表中的元素的位置