Question 7 Let T(n) be the number of different binary search trees on n distinct elements. Then , where x is A n – k + […]

Question 48 Draw all binary trees having exactly three nodes labeled A, B and C on which Preorder traversal gives the sequence C, B, A. A […]

Question 34 The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is: A n/2 B […]

Question 3 An articulation point in a connected graph is a vertex such that removing the vertex and its incident edges disconnects the graph into two […]