• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

March 25, 2014 by Dhaval Dave

Generate Postorder traversal of Tree from Inorder and Preorder traversal of tree without generating Tree.

Input:
In-order traversal in[] = {4, 2, 5, 1, 3, 6}
Pre-order traversal pre[] = {1, 2, 4, 5, 3, 6}

Output:
Post-order traversal is {4, 5, 2, 6, 3, 1}

         1
       /  \    
      2    3
    /  \    \
   4    5    6

We can print post-order traversal without constructing the tree. 

  1. Root is always the first item in preorder traversal and it must be the last item in postorder traversal.
    – Here take 1.
  2. We first recursively print left subtree, then recursively print right subtree.
    – From In-Order take Left nodes of root as left subtree and right nodes as right subtree
    – eg here 4,2,5 as Left subtree and 3,6 Right subtree of 1.
    – Check Pre-order here U can understand 2 is root of left subtree and and at left of 2 all nodes will be at left subtree and right of 2 are right subtree of 2.
    they are 4, and 5.
  3. Print left subtree first.
  4. Same traverse for right subtree of 1 and u’ll find 3 as root of right subtree and 6 as right subtree of 3.
  5. print this right subtree.

Code

#include <iostream>using namespace std;
int search(int arr[], int x, int n)
{
    for (int i = 0; i < n; i++)  if (arr[i] == x)  return i;  return -1; }
 
void printPostOrder(int in[], int pre[], int n)
{
   int root = search(in, pre[0], n);

   if (root != 0)
     printPostOrder(in, pre+1, root);

   if (root != n-1)
      printPostOrder(in+root+1, pre+root+1, n-root-1);
  
 cout << pre[0] << " ";
}


Similar Articles

Filed Under: Adobe Interview Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: Binary Tree, tree

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Templates in C++

Given Set of words or A String find whether chain is possible from these words or not

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Number of Islands BFS/DFS

Binary Tree in Java

Generate largest number arranging a no. of given non negative integer numbers

Spanning Tree

CodeChef’ RRCOPY

Password Predictor

Skiing on Mountains Matrix

Python Array String

Code Chef PRGIFT Solution

Count number of ways to reach a given score in a game

flattens 2 D linked list to a single sorted link list

Adobe Interview Questions 8 month Exp

Add Sub Multiply very large number stored as string

FizzBuzz Solution C C++

Sort an array according to the order defined by another array

Trapping Rain Water

Best Java Book | Top Java Programming Book for Beginners

1014 Practice Question of New GRE – Princeton

Walmart Labs Interview Experience

Level order traversal in Spiral form

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

SAP Interview Questions

Find if two rectangles overlap

C Program for TAIL command of UNIX

Apriori algorithm C Code Data Mining

Given a string, find the first character which is non-repetitive

Sequence Finder Dynamic Programming

Copyright © 2025 · Genesis Framework · WordPress · Log in