edited by
255 views
0 votes
0 votes

The preorder traversal of a binary search tree is given by $12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20$.

Then postorder traversal will be:

  1. $2, 6, 7, 8, 9, 10, 12, 15, 16, 17, 19, 20$

  2. $2, 7, 6, 10, 9, 8,15, 17, 20, 19, 16, 12$

  3. $7, 2, 6, 8, 9, 10, 20, 17, 19, 15, 16, 12$

  4. $7, 6, 2, 10, 9, 8, 15, 16, 17, 20, 19, 12$

edited by

1 Answer

Related questions

0 votes
0 votes
1 answer
1
admin asked Jul 21, 2022
496 views
The number of un-labeled non-isomorphic graphs with four vertices is:$12$$11$$10$$9$
0 votes
0 votes
1 answer
2
admin asked Jul 21, 2022
339 views
How to add a background color in $\text {HTML}$ for marquee Tag?<marquee bgcolor : “red”><marquee bg-color = “red”><marquee bgcolor = “red”><marquee color = �...
0 votes
0 votes
1 answer
3
admin asked Jul 21, 2022
350 views
Maximum number of bits required to represent any character from $\text {ASCII}$ code set is:$10$$8$$7$$3$
0 votes
0 votes
1 answer
4
admin asked Jul 21, 2022
343 views
$\text{ALU}$ does not perform the operation of:Data transferLogical operationArithmetic operationComparison operation