# Binary search tree: which of the below statements are correct about a binary search tree?
assume that n is the no of nodes in that tree. let d be the depth of the tree. and has n no of nodes. also assume that tree is equally balanced.
i. no of nodes = (2^(d+1) ) - 1
ii. no node has depth > log n (base 2)
iii. running time complexity of insert, find, remove functions are proportional to depth of deepest node visited.