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
Answer:
CISSP
Explanation:
The CIDDP concentrations are an extension and development on the knowledge and credentials of the standard CISS certification that improves employability and career advancement
The CISSP concentrations includes
Information System Security Architecture Professional which can be known as ISSAP
Information System Security Engineering Professional which can be known as ISSEP
Information System Security Management Professional which can be known as ISSMP.
Answer:
True
Explanation:
<em>IP Address</em>: It is used to uniquely identify each device over the network.
Z-y bcuz it is a function and u need to revail rate
