Introduction - If you have any usage issues, please Google them yourself
Based on Delphi singly linked list application that demonstrates the definition of the head node, the definition of the current node, refresh the tree, get the current node by node data, add the head node, insert nodes, delete nodes, delete tail node, add the basic operation of the list node data, this example can be understood by some of the knowledge tree control aspects of Delphi.