1.13 learning summary

Today's talk is about the data structure Trees and binary trees . Then learn about Several representations of trees . That is, several methods of building trees . In the big talk data structure, there are . Parent representation and child representation Parental representations are still stored only in structures . Son Trees Parents . To express Tree structure . Then this must be for traversal , It's inconvenient .

Then there is a kind of , Call the child's representation   Method to build a Tree structure .  It has one more linked list in each node to store it . Of all the children   data .  Put the best method , Is to combine the two .  In this way, we can quickly find the parents and children of a node . So if you are not familiar with the knowledge of linked lists , May even Building a tree structure is difficult .  So I also understand the knowledge in the data structure   There is continuity .  Every part of the study should be done well , Lay the foundation . Be familiar with .   Then for a special tree structure , It is the so-called binary tree . The characteristic of binary tree is that each node has two children Trees or not , Or a .  I haven't read all the content either   It can be felt that there are two possibilities in each case . I hope I can learn more tomorrow .