Answer:
Example 1:
def function(num):
print(num*2)
Example 2:
function(5)
num = 2
function(num)
function(3-1)
Explanation:
Given:
See attachment for complete question
To start with Example (1)
def function(num):
print(num*2)
<em>Note that; the above code segment which doubles the parameter, num could have been any other code</em>
<em />
<em>In Example (1), the parameter is num</em>
For example (2):
We can call the function using:
#1. A value:
function(5)
<em>In #1, the argument is 5; a value</em>
#2. A Variable
num = 2
function(num)
<em>In #2, the argument is num; a variable</em>
#3. An Expression
function(3-1)
<em>In #3, the argument is 3-1; an expression</em>
At the top of their name when they answer it should say “give brainliest”
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.