374 views
Draw all binary trees having exactly three nodes labeled $A, B$ and $C$ on which preorder traversal gives the sequence $C, B, A$.
edited | 374 views

$5$ Binary trees

edited by
0

......

Am getting 3 binary trees 1 left skewed ,1 right skewed,1 c as root b as left child and a as right child