Binary tree Traversals I Starter Quiz

Number of BSTs possible with 6 keys are?

Suppose we want to search for an element 70 in a Binary Search tree. Which of the following probe sequences are not valid while searching a Binary Search tree?

Consider an empty binary search tree. The elements 22, 25, 13, 4, 16, 30, 10, 14 are inserted in an empty binary search tree in the given sequence. Let h be the height obtained.
The element at the 4th level(level-1 is top level) is ?

Observe the BST given below and answer the questions that follow.

Two leaf nodes are marked as X and Y, the values of which are missing. Let the number of values node marked X can take is "a", and the number of values node marked Y can take is "b". The values placed in leaf nodes marked as X and Y should be such that all the nodes in the BST have distinct values. Assume that all the values are integers.

Find the value of 10b+a __________.

Consider an empty Binary Search Tree in which the elements are inserted in the order :

20, 30, 15, 10, 7, 80, 45, 25, 17 and 6 Find the element which is inserted at the last level of BST _______.