From tree traversal to managed and managed thinking

The React DIF algorithm does breadth-first traversal, determines that a subtree needs to be updated, deleted, and replaced. Specific research and development must be depth first, specific to the implementation of the leaf node, and then to another leaf node, as the root node to string together the results of the implementation