Mainly just memories, the previous focus should be different from this year’s! !
I remember that the amount of questions we had at that time seemed a bit large (it may also be that my ink was poor when answering questions)
What impressed me the most was the sorting of the last question (I think it will definitely be a big question?)
Then there was an adjustment process for a balanced binary tree
. Then there were code questions. It seemed like the tree was tested? (Other classes said it, but our class didn’t. I really don’t remember it. It seems to be the last question)
It seems that there is a binary search that requires several searches (small question), deleting an element in a linked list, inserting an element, etc.
The hash table seems to have tested conflicts,
and the Huffman tree has also tested
the number of leaf nodes (just remember some conclusions)
I watched this guy’s crash course hahaha: https://space.bilibili.com/324400190
Video link:
https://www.bilibili.com/video/BV16J411b7ar/?spm_id_from=333.337.search-card.all.click&vd_source =b7d0ddcb4595be10bbe2b26f522f488d
In fact, it is similar to this brother’s summary. Just do the questions again.
