Lowest Common Ancestor of a Binary Tree

Question Explain

Given a binary tree and two nodes $p$ and $q$, find the Lowest Common Ancestor (LCA) of the two nodes.