**Compilation/Execution Result:**

Write a function to print spiral order traversal of a tree. For below tree, function should print 1, 2, 3, 4, 5, 6, 7.

** **

**Input:**

The task is to complete the method which takes one argument, root of the Tree. The struct node has a data part which stores the data, pointer to left child and pointer to right child.

There are multiple test cases. For each test case, this method will be called individually.

**Output:**

The function should print level order traversal in spiral form .

**Constraints:**

1 <=T<= 30

1 <=Number of nodes<= 3000

1 <=Data of a node<= 1000

**Example:
Input:**

2

2

1 2 R 1 3 L

4

10 20 L 10 30 R 20 40 L 20 60 R

**Output:**

1 3 2

10 20 30 60 40

There are two test casess. First case represents a tree with 3 nodes and 2 edges where root is 1, left child of 1 is 3 and right child of 1 is 2. Second test case represents a tree with 4 edges and 5 nodes.

Author: Shubham Joshi 1

rksingh | 54 |

Lam Ngoc Pham | 53 |

Shashank_Pathak | 44 |

yash46 | 37 |

Manoj Kumar 36 | 35 |

Shashank_Pathak | 628 |

surbhi_7 | 556 |

dark_knights | 554 |

Infinty | 344 |

Vasudha Gupta | 340 |

akhayrutdinov | 4156 |

sanjay05 | 3611 |

Quandray | 2811 |

Ibrahim Nash | 2475 |

Michael Riegger | 2290 |