1. A B-tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index ,then the maximum number of nodes that could be newly created in the process are :
Terms And Service:We do not guarantee the accuracy of available data ..We Provide Information On Public Data.. Please consult an expert before using this data for commercial or personal use