Q2: consider the following Binary Search tree: Answer the following questions for the BST shown above. - What is the height of this tree? - Name the children of 42 - Write down the pre-order traversal of this tree. - Write down the in-order traversal of this tree. - Write down the post-order traversal of this tree. - How many steps are required to find the node with data value 48 ? Q3: Full binary tree has height 4, What is the number of nodes