Insertion/Deletion on ArrayList is faster than LinkedList
Queue is FIFO, Stack is LIFO
The worst time complexity of Searching in Binary Search Tree is O(log n)
For Red-Black Tree, if a node is red, then both its children are black.
这道题你会答吗?花几分钟告诉大家答案吧!
扫描二维码,关注牛客网
下载牛客APP,随时随地刷题