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:

- Convert binary tree to its Sum tree Medium
- Check the completeness of given binary tree | Set 1 - Using Node Count Medium
- Given a binary tree, Find the Maximum Path Sum between Any Two Leaves Medium
- Given an array, print all unique subsets with a given sum. Medium
- Text Justification Problem (OR Word Wrap Problem) Hard
- In a number, add digits until it becomes a single digit Beginner
- Print All Elements of Two Dimensional Array in Spiral Medium
- Make a Binary Tree from Given Inorder and Preorder Traveral. Hard

---