Answer:
Heap is useful when you want to find max/min element in the given list
BinarySearchTree is used if you need sorted elements of the list
Explanation:
Heap is Good at finding Min/Max and it's time complexity is (O(1)), while BST is good at all finds (O(logN)). Insert is O(logN) for Heap and BSTstructures..
Max Heap ensures that elements on higher levels are greater than elements at lower level
MinHeap ensures that elements on higher levels are lesser than elements at lower level
BST gives sorted elements by following order (left,root,right).If we want sorted elements we can go with BST
Secure enough to keep someone out who get on your pc but you should encrypted it so no one o the pc or remotely access it with out a password or with out decrypting it
If an iphone go to the open book icon then go to history and clear from there if on a laptop go to the top right and look at the three ... press it and go to history and press clear history I don’t remember about android
I think:
<span> C) Regularly check Publisher's 'Rejected' Tab <span>D) Enable email notifications for failed messages under Preferences</span></span>
But I am not sure.
