In a binary search tree, the maximum number of nodes at depth 'd' is 2^d, as each node can have two children.
