严老师答网友问（Strict teacher answers net friend to ask）.docVIP

严老师答网友问（Strict teacher answers net friend to ask）questions Hello, Miss Yan, I have a little problem for you! Problem sets 6.56 (first order, subsequent clues, two nodes in the tree to find the first sequence of P subsequent) Is it okay if you do that? BTNode *PreOrer_Next (BTNode *p) {if (p-lchild) return p-lchild; Else return p-rchild; } If not, please enlighten!! [strict teacher answers] Your algorithm is correct, because the subject condition is only following clues, so if there is no left subtree of the node, the left pointer is empty, no matter whether there is the right subtree, the right pointer is its successor. If the storage structure is a full clue, you can change it slightly. The questioner jxdxfxy Hello, strict teacher: Your C language version of the eleventh chapter of eleventh questions, I suanlaisuanqu are 550 times, 532 times and not the answer!!! The first problem of copying are as follows: The initial merge length is 47, 9, 39, 18, 4, 12, 23, 7, and 3 Road balanced merge at least read and write out the number of. [strict teacher answers] The answer to the book is wrong. Your answer 550 is correct. Since the length given in the original question is not the present number, the printing error has not been found. Thank you for correcting this mistake. The questioner laserren About the title set C, 7.25, prompted to speak more complex, depth first search, the graph traversal, the main attention to what problems? Is that the problem of recursion? [strict teacher answers] In the textbook of the graph depth first search algorithm is 7.4 for non connected graph traversal algorithm 7.5 can achieve the connectivity graph traversal traversal, but is the result of a vertex access sequence, rather than path. Although paths can be represented by vertex sequences, it is important that each edge of the sequence must have an edge between two adjacent vertices. For example, in the book example, the vertex depth first search access sequence is: V1, V2, V4,