Given a tree and a node, the task is to reverse the path till the given Node and print the in-order traversal of the modified tree.
Input: 7 / \ 6 5 / \ / \ 4 3 2 1 Node = 4 Output: 7 6 3 4 2 5 1 The path from root to node 4 is 7 -> 6 -> 4 Reversing this path, the modified tree will be: 4 / \ 6 5 / \ / \ 7 3 2 1 whose in-order traversal is 7 6 3 4 2 5 1 Input: 7 / \ 6 5 / \ / \ 4 3 2 1 Node = 2 Output: 4 6 3 2 7 5 1
- First store all the nodes on the given path in a queue.
- If the key is found then replace this node data with front of queue data and pop the front.
- Keep on performing this operation in the recursive way upto the root and the path will be reversed in the original tree.
- Now, print the in-order traversal of the modified tree.
Below is the implementation of the above approach:
7 6 3 4 2 5 1
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Reverse a path in BST using queue
- Stack and Queue in Python using queue Module
- Check if a queue can be sorted into another queue using a stack
- Reversing a Queue using another Queue
- Reverse tree path
- Convert a Binary Tree to Threaded binary tree | Set 1 (Using Queue)
- Difference between Circular Queue and Priority Queue
- Minimum cost to reverse edges such that there is path between every pair of nodes
- Right view of Binary Tree using Queue
- Find maximum and minimum element in binary tree without using recursion or stack or queue
- Find the Deepest Node in a Binary Tree Using Queue STL - SET 2
- Reverse Morris traversal using Threaded Binary Tree
- Reverse alternate levels of a perfect binary tree using Stack
- Maximum weighted edge in path between two nodes in an N-ary tree using binary lifting
- Reverse zigzag Traversal of a Binary Tree
- Reverse Clockwise spiral traversal of a binary tree
- Reverse Anti Clockwise Spiral Traversal of a Binary Tree
- Reverse alternate levels of a perfect binary tree
- Complexity of different operations in Binary tree, Binary Search Tree and AVL tree
- Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.