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.
A compiler is a series of programs that (usually) convert source code into machine language. There are also compilers that compile into byte code, Java for instance.
No compiler is responsible for executing a freshly compiled program. That would be done in an IDE (Integrated Development Environment).
<u>Answer:</u>
<em>feetFab1 = int(input(""Enter the value in feet for the 1st piece of fabric: ""))</em>
<em>inchFab1 = int(input(""Enter the value in inches for the 1st piece of fabric: ""))</em>
<em />
<em>feetFab2 = int(input(""Enter the value in feet for the 2nd piece of fabric: ""))</em>
<em>inchFab2 = int(input(""Enter the value in inches for the 2nd piece of fabric: ""))</em>
<em />
<em>feetSum = (feetFab1 + feetFab2)</em>
<em>inchSum = (inchFab1 + inchFab2)</em>
<em />
<em>totalFeet = ((inchSum % 12) + feetSum)</em>
<em>totalInch = (feetSum % 12)</em>
<em>print (""Feet: "" + str(totalFeet) + "". Inches: "" + str(totalInch))</em>