Create a binary search tree by adding your student ID values in order:

No tunderstanding which is the correct answer

Please help with 3rd section (in images below), code for first and second class included below. Do not change the  function names or given starter code in the script. Each class has different requirements, read them carefully. Do not use the exec or eval functions, nor are you allowed to use regular expressions (re module).  All methods that output a string must return the string, not print it. If you are unable to complete a method, use the pass statement to avoid syntax errors.    class Stack:    def __init__(self):        self.stack = []     def pop(self):        if len(self.stack) < 1:            return None        return self.stack.pop()     def push(self, item):        self.stack.append(item)     def size(self):        return len(self.stack)     def peek(self):        return self.stack[self.size() - 1]     def isEmpty(self):        if len(self.stack) < 1:            return True        return False class Calculator:    def __init__(self):        self.__expr = None…

An algorithm should be clear of ambiguity if it has been thoroughly thought out.