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: D. enter each major point from the outline on a separate line
Answer:
Write convert() method to cast double to int Complete the convert() method that casts the parameter from a double to an integer and returns the result. Note that the main() method prints out the returned value of the convert() method.
Ex: If the double value is 19.9, then the output is: 19
Ex: If the double value is 3.1, then the output is: 3
Explanation:
<h3>
plz bhai mera answer ko brainliest kar do.....</h3>
