IMPLEMENTATION OF BINARY SEARCH TREES DevC++ Code (paste the link to browser): https://paste.ofcode.org/K3uqRBy7z65V4exvcrShgF Focus on the main (driver program) or int main (), just make a MENU DRIVEN program by relating to the program template. Laboratory Task 8: Create a menu-driven program that will properly insert a new element to the Binary Search Tree (BST). The options of the program are the following: 1. Insert Element 2. Display Binary Search Tree 3. Exit Option (1) inserts a new element to its proper location in the BST. Take note of the following properties of the Binary Search Tree: The left subtree of a node contains only nodes with elements lesser than the element. The right subtree of a node contains only nodes with elements greater than the node s element. The left and right subtree each must also be a BST. There must be no duplicate nodes. Option (2) displays all the elements in the BST in proper order. Option (3) exits the program.

A loop that iteratively processes a given list is called a for construct. So long as there are things to process, it will keep running. To what extent is this statement accurate or false?

Data Structures/Algorithms in Java

def__init__(self): """ ------------------------------------------------------- Initializes an empty Queue. Data is stored in a Python list. Use: source = Queue() ------------------------------------------------------- Returns‌​‌​​​​‌​​‌‌​​​‌​​​​‌‌​‌​‌‌‌: a new Queue object (Queue) ------------------------------------------------------- """ self._values = []   defis_empty(self): """ ------------------------------------------------------- Determines if source is empty. Use: b = source.is_empty() ------------------------------------------------------- Returns‌​‌​​​​‌​​‌‌​​​‌​​​​‌‌​‌​‌‌‌: True if source is empty, False otherwise. ------------------------------------------------------- """ return len(self._values) == 0   def__len__(self): """ ------------------------------------------------------- Returns the length of source. Use: n = len(source) ------------------------------------------------------- Returns‌​‌​​​​‌​​‌‌​​​‌​​​​‌‌​‌​‌‌‌: the number of values in source (int >= 0)…