can you answer in cpp please? it's a data structure course , you can implement it using linked list preferably

The lowest common ancestor (LCA) of two nodes x and y in the BST is the lowest (i.e., deepest) node that has both x and y as descendants, where each node can be a descendant of itself (so if x is reachable from w, w is the LCA). In other words, the LCA of x and y is the shared ancestor of x and y that is located farthest from the root. Given a BST and two nodes x and y in it, write a function that returns the lowest common ancestor (LCA) of x and y. For example, consider the following BST: 15 LCA (6, 12) = 10 LCA (10, 12) = 10 LCA (20, 6) = 15 LCA (18, 22) = 20 LCA (30, 30) = 30 10 25 8 12 20 30 18 22 Lowest Common Ancestor in BST