This post is completed by 1 user Login To Mark Completed

0

Add to List Add To List..(Max 5) Close Save

Medium

Reverse Alternate levels of a given Binary Tree.

Objective: - Reverse Alternate levels of a given binary tree

Input: A binary tree

Example:

Appraoch:

• Do the inorder traversal and store all the alternate level nodes in an ArrayList.
• Reverse the ArrayList
• Do another inorder traversal and place the reversed array list in the same order in which it was fetched in step one.
• Look at the code for a clear explanation.

Run This Code

Code:

Output:

1
2 3
4 5 6 7
8 9 10 11 12 13 14 15

New Tree, Alternate Levels Reversed..
1
3 2
4 5 6 7
15 14 13 12 11 10 9 8

---

---

Also Read:

- Inorder Predecessor and Successor in Binary Search Tree Hard
- Find whether a Given Binary Tree is Balanced? Medium
- Lowest Common Ancestor in a Binary Tree (Not Binary Search Tree). Hard
- Print All Nodes Between Two Given Levels Medium
- Construct a binary tree from given Inorder and Level Order Traversal Hard
- Print All Possible Valid Combinations Of Parenthesis of Given 'N' Medium
- Search the Element in a binary tree - With and Without Recursion Beginner
- Inorder Successor in Binary Tree Medium

---