The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+13 votes
452 views
Draw the binary tree with node labels $\text{a, b, c, d, e, f and g}$ for which the inorder and postorder traversals result in the following sequences:

Inorder: $\text{a f b c d g e}$

Postorder: $\text{a f c g e d b}$
asked in DS by Veteran (59.5k points) | 452 views

1 Answer

+17 votes
Best answer

The binary tree will be

 

answered by Loyal (5.9k points)
edited by


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

38,174 questions
45,676 answers
132,609 comments
49,563 users