Java interview questions, java questions

Java interview questions, java questions

1. storage structures used by stacks and queues

Chain storage and sequential Storage

2. understanding of time complexity and space complexity
Time Complexity: Number of statement executions in an algorithm, which is T (n). When n changes, it is O (f (n). For example, constant O (1 ), O (n2), O (nlog2n)
Space complexity: the storage space consumed by an algorithm, including the storage space occupied by the algorithm itself, the space occupied by the algorithm input data, and the data temporarily generated during algorithm running

3. Binary Tree Algorithm
First Order ABGGCEFH Middle Order DGBAECHF find follow

Left and right of the root in the forward Order (where can I find the root node)
Left root right in the middle order (you can obtain data between the left and right sides of the node)
Followed by left and right roots (you can find out where the heel node is)