1.In a singly linked list of N nodes, the time complexities for query and insertion are O(1) and O(N), respectively.
2.If N numbers are stored in a singly linked list in increasing order, then the average time complexity for binary search is O(logN).
3.If keys are pushed onto a stack in the order abcde, then it‘s impossible to obtain the output sequence cedab.
原文：https://www.cnblogs.com/nonlinearthink/p/11735810.html