2 and right as links to its left and right kids. See the example below. A BST can be implemented with a linked list. Each node has two fields left class BinaryLink: definit_(self, val, left-None, right-None): selfival = val self.left=left o self.right = right Design an algorithm for searching for a value through a BST. If the value is found, return the index; otherwise, return -1.(pseudo code required)