Answer:
Some differences between Heap and Binary search trees are as following:-
A heap is a complete binary tree.While a Binary Search Tree may be a complete,prefect binary tree.
A minheap the root should be minimum than it's children So it efficient for finding minimum and maximum.While Binary search trees have different properties the root node should be greater than the left child and should be less than the right child.
First, I would document the hazard and compare it with OSHA standards. If,at that point you still believe it is a violation, bring it to the attention of your supervisor, by showing him her.
You could end the discussion with, "Is there some way I can help?"
From there you observe if this is remedied. If not, you have to decide if you will report it yourself.
When expensive machinery is required to install and configure.
2. Most of the employees are not computer literate, so what will you do to manage the situations may oppose by the employee
