Software Analyst

You have been given two integers 'N' and 'D', Your task is to find the square root of the number 'N' with precision up to 'D' decimal places i.e. the difference between your answer and the correct answer should be less than 10 ^ (-D).

For example if N = 10 and D = 3, then your answer will be 3.162.

You are given a binary search tree which is also a complete binary tree. You have to convert the given BST into a Min Heap with the condition that all the values in the left subtree of a node should be less than all the values in the right subtree of the node.

A binary search tree (BST) is a binary tree data structure which has the following properties.

• The left subtree of a node contains only nodes with data less than the node’s data.
• The right subtree of a node contains only nodes with data greater than the node’s data.
• Both the left and right subtrees must also be binary search trees.

A Binary Tree is a Complete Binary Tree if all the levels are completely filled except possibly the last level and the last level has all keys as left as possible.

A Min Heap is a binary tree in which the value in each internal node is smaller than or equal to the values in the children of that node. In this problem, there is also a condition that all the values in the left subtree of a node should be less than all the values in the right subtree of the node.

Note :

You do not need to print anything, just return the root of the Min Heap

Why should we hire you?

What do you expect from this job role?