TREEORD - Tree _order


Description

A tree is a connected acyclic graph.
A binary tree is a tree for which each node has a left child, a right child, both, or neither, e.g.
    1
   / \
  2   3
 / \   \
4   5   6
There are three common ways to recursively traverse such a tree.
  1. Preorder: parent, left subtree, right subtree
  2. Postorder: left subtree, right subtree, parent
  3. Inorder: left subtree, parent, right subtree
Given preorder, postorder, and inorder traversals, determine if they can be of the same binary tree.
For example,
1 2 4 5 3 6
4 5 2 6 3 1
4 2 5 1 3 6
are the preorder, postorder, and inorder traversals of the tree above.
But
1 2 4 5 3 6
4 5 2 6 1 3
4 2 5 1 6 3
cannot be the preorder, postorder, and inorder tranversals of the same binary tree.

Input

The first line is the number of nodes in each traversal, 0 < N <= 8000.
The second line is the N space seperated nodes of the preorder traveral.
The third line is the N space separated nodes of the postorder traversal.
The fourth line is the N space separated nodes of the inorder traversal.
Each traversal is a sequence of the nodes, numbered 1 to N, without repitition.

Output

Print "yes" if all three traversals can be of the same tree, and "no" otherwise.
Input Input
6
1 2 4 5 3 6
4 5 2 6 3 1
4 2 5 1 3 6
6
1 2 4 5 3 6
4 5 2 6 1 3
4 2 5 1 6 3
Output Output
yes
no

hide comments
saltyfish233: 2017-11-19 13:21:16

I don`t use recursion but I use stack to solve it :D

kspoj: 2017-11-11 18:05:40

Wow..This.Is.Cool
Learnt some.... :0 :D

Pranv Gupta: 2017-03-31 11:37:21

nice question, but wondering if there is only ONE testcase of this problem

deerishi: 2016-10-22 23:43:56

MY 100th! 0.00 sec.!! Funny thing : With and without Tree construction with Fast IO accepted in 0.00s !! Without tree construction is cooler though.

Last edit: 2016-10-23 00:57:34
cnexans: 2016-08-04 06:57:48

I found it tricky. Finally AC.

kartikay singh: 2016-06-30 20:50:36

Nice problem :-)
Easy recursion

naufalpf: 2016-04-09 14:20:36

y

sumbayak_ae: 2016-04-07 14:12:42

Sesi Lab, ez :v

Last edit: 2016-04-07 14:27:26
sumbayak_ae: 2016-04-07 14:09:54

AC in one go. Nice problem. Think of recursion ;D

Archit Gupta: 2016-02-26 11:04:52

AC in first attempt easy prob 150th on spoj!


Added by:BYU Admin
Date:2014-02-23
Time limit:0.5s-3s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64