Answer:
See explaination
Explanation:
def readFileFirstLast(filename):
# doc string
''' Function accept the filename and opens the fle
and reads all lines and strips new line character and
stores first and last in a string and return that string'''
#eception handle if file not found
try:
#opening the file
f = open(filename)
#reading the first line and striping the ne line
string = f.readline().strip()
#iterating until last line
for line in f:
pass
#concate the last line after strip the new line character to the string
string = string + " " + line.strip()
#return the string
return string
except:
#if file not found
return "File not found"
#taking the file name from user
filename = input("Enter a file name: ")
#printing the doc string in function
print("\ndoc_sting: \n"+ readFileFirstLast.__doc__+"\n")
#printing the returned string by calling the readFileFirstLast()
print("output string :")
print(readFileFirstLast(filename))
Answer:
The new root will be 2.
<em></em>
Explanation:
The binary tree is not properly presented (See attachment)
To answer this; first, we need to order the nodes of the tree in a pre-order traversal.
We use pre-order because the question says if something is removed from the left child.
So, the nodes in pre-order form is: 14, 2, 1, 5, 4, 16.
The root of the binary tree is 14 and if 14 is removed, the next is 2.
<em>Hence, the new root will be 2.</em>
