1 votes 1 votes For a B-tree of height h and degree t, the total CPU time used to insert a node is O(h log t) O(t log h) O(t$^2$h) O(th) Others ugcnetcse-june2013-paper2 + – go_editor asked Jul 14, 2016 go_editor 2.6k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Inserting a key k into a B-tree T of height h is done in a single pass down the tree, requiring O(h) disk accesses. The CPU time required is O(th) = O(t logt n). option D Debasmita Bhoumik answered Feb 3, 2017 Debasmita Bhoumik comment Share Follow See 1 comment See all 1 1 comment reply gate_forum commented Dec 22, 2018 reply Follow Share Can u please explain? 0 votes 0 votes Please log in or register to add a comment.