👤

assuming that the tree is kept on a disk and one node may be retrieved at a time, how many disk accesses are needed to make each insertion? state any assumptions you make