UpTest > Databases > Data Structures Test

Test: Data Structures Test

Question 1: Prev Next
Tree algorithms typically run in time O(d) . What is d?
The depth of the tree
The number of divisions at each level
The number of nodes in the tree
The total number of entries in all the nodes of the tree

Please login to submit your answer.