Register

GO Classes DPP | PYTHON & DSA |TREE

212 views
0 0 votes

You are given the Post-order traversal of a Binary Search Tree: $[10,30,20,50,70,60$, 40]. What is the In-order traversal of this same tree?

  1. $[10,20,30,40,50,60,70]$
     
  2. $[40,20,60,10,30,50,70]$
     
  3. $[70,60,50,40,30,20,10]$
     
  4. It cannot be determined without the Pre-order traversal.

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes DPP | PYT...Next → · GO Classes DPP | PYT...
← Previous in category · GO Classes DPP | PYT...Next in category → · GO Classes DPP | PYT...
Position:
Show:

Related questions

1 1 vote
1 1 answer
251
251 views
GO Classes asked Jan 23
251 views
GO Classes DPP | PYTHON & DSA |PYTHON
In Python, dictionaries and sets are implemented using Hash Tables. Consider the following code:class Point: def __init__(self, x, y): self.x = x self...
0 0 votes
1 1 answer
197
197 views
GO Classes asked Jan 23
197 views
GO Classes DPP | PYTHON & DSA |GRAPH
You are designing a system to represent a very sparse graph with $V$ vertices and $E$ edges (where $E \ll V^2$ ). You need to frequently perform the operation: "Find all ...
0 0 votes
1 1 answer
216
216 views
GO Classes asked Jan 23
216 views
GO Classes DPP | PYTHON & DSA |PYTHON
Consider the following Python function that uses a list as a stack.def mystery_process(elements): stack = [] result = [] for x in elements: while stac...
1 1 vote
1 1 answer
193
193 views
GO Classes asked Jan 23
193 views
GO Classes DPP | PYTHON & DSA |PYTHON
Which of the following code blocks will produce a dictionary where the keys are numbers from $1$ to $3$ and the values are their squares, but ONLY if the square is an eve...