LCA 1 BInary Tree Problem

#1

Does this problem uses the concept of backtracking to check whether element is present on left node or right node ??

#2

No,what you can do is pass parent in each call then check whether current node is left child of its parent or not

#3

https://ide.codingblocks.com/s/261233 Is this Correct ???

#4

Hey,this is not the most optimized code.
Try to do it without extra space.
Hint:for every node,find if either left or right have both node.The first node from root that have both nodes in opposite subtree is the result.