1. Second Largest Problem Write a function second_largest() that takes a B Binary Search Tree (BST) as input and finds the second largest value in the given BST. You may assume that the BST has at...

use python to solve this question

Extracted text: 1. Second Largest Problem Write a function second_largest() that takes a B Binary Search Tree (BST) as input and finds the second largest value in the given BST. You may assume that the BST has at least two nodes, and that all of the node values are distinct. Sample >>> nodes = [68, 88, 61, 89, 94, 50, 4, 76, 66, 82] >>> second_largest(bst) '2nd largest element is 89'


Extracted text: def insert(bst , key): if bst == {}: bst['value'] = key = {} bst['left'] bst['right']= {} elif bst['value'] < key:="" insert(bst['right'],key)="" elif="" bst['value']=""> key: insert(bst['left'],key) v nodes = eval(input()) bst = {} for n in nodes: insert(bst , n) second largest (bst)