What are the worst-case complexities of insertion and deletion of a key in a binary search tree?

Consider the following rooted tree with the vertex labelled P as the root The order in which the nodes are visited during an in-order traversal of the tree is

Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly 4 nodes O(n^a Log^bn ). Then the value of a + 10b is _________

A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?