Complete the function to find spiral order traversal of a tree. For below tree, function should return 1, 2, 3, 4, 5, 6, 7.
Example 1:
Input:
1
/ \
3 2
Output:1 3 2
Example 2:
Input:
10
/ \
20 30
/ \
40 60
Output: 10 20 30 60 40
Your Task:
The task is to complete the function findSpiral() which returns the elements in spiral form of level order traversal as a list. The newline is automatically appended by the driver code.
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(N).
Constraints:
0 <= Number of nodes <= 105
1 <= Data of a node <= 105
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
| Pathak1899 | 436 |
| yashdip123 | 380 |
| kirtidee18 | 377 |
| ykaushik | 261 |
| _saswata | 232 |
| kirtidee18 | 1057 |
| ykaushik | 733 |
| aggarwalvatsal5 | 709 |
| pmr_3689 | 570 |
| harbilassingh | 530 |
| blackshadows | 5456 |
| Ibrahim Nash | 5450 |
| akhayrutdinov | 5111 |
| mb1973 | 4976 |
| Quandray | 4823 |
Input Format:
The tree in the input is given in the form of a string as described below.
The values in the string are in the order of level order traversal of the tree where, numbers denote node values, and a character “N” denotes NULL child.
For example:
For the above tree, the string will be: 1 2 3 N N 4 6 N 5 N N 7 N
Example:
1 3 2
Input Format:
The tree in the input is given in the form of a string as described below.
The values in the string are in the order of level order traversal of the tree where, numbers denote node values, and a character “N” denotes NULL child.
For example:
For the above tree, the string will be: 1 2 3 N N 4 6 N 5 N N 7 N
Example:
1 3 2