Lowest Common Ancestor in a Binary Tree

Given a binary tree and two values, find the lowest common ancestor (LCA) of the two nodes that have the given values. Read the tree structure from standard input: - The first line contains an integer, n, the number of nodes in the tree. - The next n lines list each node's value and the left and right child indices. A child index of -1 indicates no child. - The last line contains two integers, p and q, the values for which the LCA needs to be found. Output a single integer representing the value of the LCA. Example: Input: 5 3 1 2 1 -1 -1 2 -1 -1 5 -1 -1 4 -1 -1 4 1 Output: 3