Handle
|
Score
|
|---|---|
| @Ibrahim Nash | 6379 |
| @blackshadows | 6329 |
| @mb1973 | 5376 |
| @Quandray | 5231 |
| @akhayrutdinov | 5111 |
| @saiujwal13083 | 4510 |
| @sanjay05 | 3762 |
| @marius_valentin_dragoi | 3522 |
| @sushant_a | 3459 |
| @verma_ji | 3357 |
| @KshamaGupta | 3318 |
| Complete Leaderboard | |
|
Handle
|
Score
|
| @184025 | 110 |
| @terabaap123 | 97 |
| @arshjit_singh7 | 92 |
| @anamikaprasad124 | 92 |
| @kumsachin10 | 90 |
| @vaibhavinayak | 75 |
| @NullPointerException | 74 |
| @TanmayJ | 74 |
| @ronaldo77 | 72 |
| @bhupindersingh25122001 | 68 |
| @ritiksethi21 | 68 |
| Complete Leaderboard | |
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 takes root node as input parameter and 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
0 <= Data of a node <= 105
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes
