Timer is Running

Nodes at Odd Levels
Submissions: 8539   Accuracy:


  Difficulty: Easy   Marks: 2

Given a binary tree of size N, your task is to complete the function printOddNodes(), that print's the nodes of binary tree present at odd level of the tree.At each level print nodes in any left to right order. Root is considered at level 1.

For example consider the following tree
       /     \
      2       3
    /   \       \
   4     5       6
        /  \     /
       7    8   9

Output  1 4 5 6

The function takes a single argument as input, the reference pointer to the root of the binary tree.
There will be T testcases and for each test case the function will be called separately.

For each test case print space separated all the nodes of the tree that are present at odd level starting from level 1.



1 2 L 1 3 R
10 20 L 10 30 R 20 40 L 20 60 R 30 90 L

10 40 60 90 

Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Harshit Sidhwa, Saksham Raj Seth
Author: harshitsidhwa

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.

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.