+1 vote
in Data Structures & Algorithms I by (110k points)
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.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.