Suppose you are given a tree and asked to find out the first node at nth level. How can it be done? C code would be helpful?
Algorithm to find first node of nth level of Tree Step 1. Traverse the given tree using level order traversal method Step 1.a check n level of given tree.
if(nth level is find) print the first node of given tree. else print: the nth level is not present in the list.
2 Exit.
Given a binary tree print it in inward spiral order i.e first print level 1, then level n, then level 2, then n-1 and so on.
For Ex -
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Print- 1 15 14 13 12 11 10 9 8 2 3 7 6 5 4
Given binary tree is:
1 / \ 2 3 / \ \ 4 5 6 / \ 7 8
The output should be 1, 2, 3, 4, 5, 6, 7, 8
