binary tree is used for sorting, searching, and so on.
Multi-tree is mainly used for files and databases, because of its small height, it can reduce the number of disk io.
so the question is, since multi-tree is so good, why not replace the application of binary tree? Why do so many places use binary trees instead of multi-forked trees?
Today on the data structure, the teacher said that there are four physical structures, sequential structure, chained structure, index and hash, but the book says that there are only sequential and chained structures. So who s right. ...
enter two integer sequences, the first representing the push-in order of the stack, and the second indicating whether it is the pop-up order of the stack. It is assumed that all the numbers pressed are not equal. for example, stack pressing order: 1. T...
1010 derivation of unary polynomial Design function to find the derivative of unary polynomial. (note: the first derivative of x ^ n (n is an integer) is nx ^ n (n-1).) input format: enter polynomial non-zero coefficients and exponents in an exponent...
topic description PTA - MOOC---2018WPLWPL : the maximum length of code M is equal to 63. What exactly does this mean? doesn t N maximum 63 mean that the length of the code should not reach 63? How could that be, wrong answer?? ...