Handle
|
Score
|
|---|---|
| @Ibrahim Nash | 6560 |
| @blackshadows | 6400 |
| @mb1973 | 5777 |
| @Quandray | 5271 |
| @akhayrutdinov | 5111 |
| @saiujwal13083 | 5074 |
| @kirtidee18 | 4356 |
| @sanjay05 | 3762 |
| @mantu_singh | 3638 |
| @gfgaccount | 3601 |
| @marius_valentin_dragoi | 3525 |
| Complete Leaderboard | |
|
Handle
|
Score
|
| @anish5256 | 991 |
| @vimleshpratapsingh321 | 980 |
| @skj7 | 871 |
| @akhileshkumar562002 | 862 |
| @pradeeppatidar1999 | 840 |
| @kanewilliamson123 | 837 |
| @pd420786 | 813 |
| @infilooop | 800 |
| @bunnybug320 | 796 |
| @smitabose7826 | 784 |
| @virgat | 768 |
| 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:
Problem of the Day
Problem of the Day
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
