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.
Reference https://www.cs.cmu.edu/~adamchik/15-121/lectures/Trees/trees.html
There is no such condition so statement is false
23678 Points
17278 Points
8962 Points
6460 Points
5478 Points
5128 Points
4892 Points
4486 Points
4052 Points
3974 Points
Gatecse
X->YZ , Y->XZ , ...