Find the distance between two nodes of a binary tree in Python

# Node class for Tree 
class Node:
    def __init__(self, value):
        self.value = value
        self.right = None
        self.left = None
def root_to_Node_Path(root,Nodes, Node):
 
    if root is None:
        return False
    
    # Appending Node if treversed while reaching
    # to the desired node
    Nodes.append(root.value)
  
    # check weather root is same as Node
    if root.value == Node :
        return True
  
    # Node is found in left or right sub trees
    if ((root.left != None and root_to_Node_Path(root.left, Nodes, Node)) or
            (root.right!= None and root_to_Node_Path(root.right, Nodes, Node))):
        return True
  
    # If Node does not exist in the tree
    Nodes.pop()
    return False
 
def calculate_Distance(root, Node1, Node2):
    if root:
        # Store traversed nodes of Node1
        Nodes1 = []
        root_to_Node_Path(root, Nodes1, Node1)
 
        # Store traversed nodes of Node2
        Nodes2 = []
        root_to_Node_Path(root, Nodes2, Node2)
 
        # Iterating on both nodes treversed data
        # to find LCA (Lowest common Ancestor) distance from root
        LCA=0
        while LCA<len(Nodes1) and LCA<len(Nodes2):
            if Nodes1[LCA] != Nodes2[LCA]:
                break
            LCA = LCA+1
 
        # Calculating distance returning 
        return (len(Nodes1)+len(Nodes2)-2*LCA)
    else:
        return 0
 
# Generting tree 
root = Node(5)
root.left = Node(6)
root.right = Node(7)
root.left.left = Node(8)
root.right.left = Node(9)
root.right.right= Node(10)
root.left.right = Node(11)
root.right.left.right = Node(12)
 
# Testing Code on examples
distsnce = calculate_Distance(root, 8, 9)
print ("Distance between nodes ", distsnce)
 
distsnce = calculate_Distance(root, 12, 9)
print ("Distance between nodes ", distsnce)