Condition for binary tree is atmost two immediate child for every internal node
No it is not the condition for binary tree.
A binary tree is made of nodes, where each node contains a "left" reference, a "right" reference, and a data element. The topmost node in thetree is called the root. Every node (excluding a root) in a tree is connected by a directed edge from exactly one other node. This node is called a parent.
There is no such condition so statement is false
X->YZ , Y->XZ , ...