$1.$ Binary Tree Magic Number Sum

Consider a binary tree of N nodes $(1$ Root and N$-1$ descendants$).$ Each node X is related to Root node by a relation such as L$,$ RR$,$ RL$...$ and so on$,$ where X is left $($L$)$ to Root, or right$-$right $($RR$)$ or right$-$left $($RL$)$ to Root and so on$.$ In this tree, a node is called as a Magic parent node if one immediate child of the node is a factor of the other immediate child. A node having only one immediate child can never be a Magic parent node.

in

X

Write a program to find the sum of all Magic parent nodes in the given tree.