Provide pseudocode to implement the Findkth function on a Binary Search Tree (BST). This function should accept a pointer to the root of a BST and an integer K. The function returns the Kth smallest valu in the BST if one exists or -99999 otherwise. Assume that K is indexed starting at 0. Do not assume that height information is stored at each node. For example, FindKth(a,3) would return the value 13 for the following BST.

A singly linked list contains n - 1 strings that are binary representations of numbers from the set {0, 1,.…, n – 1} where n is an exact power of 2. However, the string corresponding to one of the numbers is missing. For example, if n = 4, the list will contain any three strings from 00, 01,10 and 11. Note that the strings in the list may not appear in any specific order. Also note that the length of each string is lgn, hence the time to compare two strings in O(lgn). Write an algorithm that generates the missing string in O(n).

Please use the alphabet shown in the screenshot below to code a Depth-first search (DFS) algorithm in C++.