Find the distance between two nodes in binary tree:

class MyTreeNode
{
public int Data { get; set; }
public MyTreeNode Left { get; set; }
public MyTreeNode Right { get; set; }
public MyTreeNode(int data)
{
this.Data = data;
}
}

class QTwoNodeDis
{
public static int Distance(MyTreeNode root, MyTreeNode node1, MyTreeNode node2)
{
var node = FindLCA(root, node1, node2);
int distLCA = FindLevel(root, node);
int dist1 = FindLevel(root, node1);
int dist2 = FindLevel(root, node2);

return dist1 + dist2 - 2 * distLCA;

}

private static MyTreeNode FindLCA(MyTreeNode root, MyTreeNode node1, MyTreeNode node2)

{
if (root == null) return null;
//
if (root.Data == node1.Data || root.Data== node2.Data)
return root;
//

MyTreeNode left_lca = FindLCA(root.Left, node1, node2);

MyTreeNode right_lca = FindLCA(root.Right, node1, node2);

if (left_lca != null && right_lca != null)

//LCA
return root;
return left_lca != null ? left_lca : right_lca;
}

private static int FindLevel(MyTreeNode root, MyTreeNode node)

{
if (root == null)
return -1;
if(root.Data == node.Data)
return 0;

int level = FindLevel(root.Left, node);

if (level == -1)
level = FindLevel(root.Right, node);
 if(level != -1)
return level + 1;

return -1;
}
}