. a) depends on the numbers. b) is larger than 20 levels. c) is smaller than 19 levels. d) can be calculate

The minimum height of a binary search tree win n keys is log2 n. Select one:  True or False

What type of BST traversal is corresponding to the code below? void Tree::Traverse(Node *node) { if (node == NULL) | | Traverse(node->left); return; Traverse(node->right); cout data << " "; } post-order in-order O pre-order O None of them