The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+13 votes
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 (68.9k points)
edited by | 338 views

2 Answers

+14 votes
Best answer

$5$ Binary trees


answered by Veteran (10.9k points)
edited by


–2 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 Veteran (14.1k points)

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

32,693 questions
39,293 answers
36,701 users