The answer is control windows
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.
Answer:
To give the computer an understanding of what it should do and how that task should be completed. It may look like gibberish, but the computer understands it. (There are also many languages of code)
