华南理工大学数据结构与算法课件Chapter2 Linear List.pptVIP

Program 2-9 shows the destructor code, its time complexity is O(n), where n is the length of the list. Program 2-10 and program 2-11 were realized Length operation and Find operations. The time complexity of length operation is O(n), the time complexity of find operation is O(k). The time complexity of output (see program 2-12) is O(n), which requires the type T must defined theoperator. Program 2-9 delete all nodes in the linked list templateclass T LinearListLinkT::～LinearListLink () { //Destructor lists, used to delete all nodes in the l