Introduction - If you have any usage issues, please Google them yourself
) To create any character and orderly (Sort Ascending) monocyclic list (that is, elements of random list of characters on your keyboard input), the length limit of 15 2) Print (traverse) the list (followed by print table of elements in value) 3) in the list to find the first i elements, i legitimate return element values, or else return FALSE 4) in the list to find the same with a known characters of the first node, I would return TRUE, otherwise, return FALSE 5) in the list in an orderly manner in accordance with the insertion of a known character elements 6) line of the table to delete the first i nodes 7) calculated the length of list.