Learning is the process of turning fragmented facts into clues, and creation is the process of reorganizing them.
I have learned from time to time. I send out the knowledge that I feel I have gained through pictures as "cloud notes", and at the same time make it public, and pick it up with those who feel the same~
Binary tree and forest transformation [Brothers are connected, eldest brother is father] The
eight sorting algorithms are a very good induction graph
Logical structure: linear table, storage structure: sequential storage, chain storage traversal method.
Find the derivation of the height of a complete binary tree
Binary tree traversal problem solution
Related screenshots for calculating the time complexity (the horizontal line on the side of the brackets only means "round down", and vice versa is "round up")
B-tree (not "B minus tree" corresponds to B+ tree, B-tree is written in this way) The form that appears in the creator's paper (how many levels of B-tree is the length of the fixed array, the figure below should be considered as level 4. But the maximum number of leaf nodes is 5, which is not so clear here.)
In addition, the dynamic adjustment process of the B-tree can be understood as [brothers split their lives—child nodes can’t ask wealthy brothers if they don’t have money. The node will give money down and ask for money (element) from the wealthy child node; if there is no wealthy brother, and the parent node has no money, it will merge back to make a living, the height of the tree will decrease]
