Short c++ help.

What is the depth of node X in the following tree? (Write a number without leading spaces) Consider the following BST: E M Choose correct inorder traversal for the tree after deleting node K from the tree. Consider lexicographical sorting among the letters. Select one: a. CBALEMN b. ABENMLC . None of these d. ABCELMN e. ABCLEMN In a BST, basic operations to search, insert, and delete run in O(h) time, where h is the height of the tree, when n = h, where n is the number of nodes, these operations are O(n) and the BST has the same runtime properties as a linked list. When the tree is balanced, the distance from the root to any leaf node at the bottom of the tree, is log(n), where n is the number of nodes in the tree. Hence the complexity to search in a balanced binary tree is Select one: a. O(nA2) b. None of these C. O(2^n) d. O(n) e. Ollog n)