The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+14 votes
466 views
Draw all binary trees having exactly three nodes labeled $A, B$ and $C$ on which preorder traversal gives the sequence $C, B, A$.
asked in DS by Veteran (59.6k points)
edited by | 466 views

2 Answers

+14 votes
Best answer

$5$ Binary trees

answered by Loyal (5.9k points)
edited by
0

......

–3 votes
Am getting 3 binary trees 1 left skewed ,1 right skewed,1 c as root b as left child and a as right child
answered by Boss (14.4k points)

Related questions



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

42,619 questions
48,614 answers
155,860 comments
63,850 users