A binary tree is a rooted tree but not an ordered tree.
A. true
B. false
I need to ask this question from Binary Trees topic in division Binary Trees of Data Structures & Algorithms I
This question was addressed to me during an interview.
Right answer is B. false
Easy explanation – A binary tree is a rooted tree and also an ordered tree (i.e) every node in a binary tree has at most two children.