Given a Binary tree and a number N, write a program to find the N-th node in the Postorder traversal of the given Binary tree.
Prerequisite: Tree Traversal
Input : N = 4 11 / \ 21 31 / \ 41 51 Output : 31 Explanation: Postorder Traversal of given Binary Tree is 41 51 21 31 11, so 4th node will be 31. Input : N = 5 25 / \ 20 30 / \ / \ 18 22 24 32 Output : 32
The idea to solve this problem is to do postorder traversal of the given binary tree and keep track of the count of nodes visited while traversing the tree and print the current node when the count becomes equal to N.
Below is the implementation of the above approach:
Time Complexity: O(n), where n is the number of nodes in the given binary tree.
Auxiliary Space: O(1)
- Find n-th node in Preorder traversal of a Binary Tree
- Find the kth node in vertical order traversal of a Binary Tree
- Postorder traversal of Binary Tree without recursion and without stack
- Postorder successor of a Node in Binary Tree
- Postorder predecessor of a Node in Binary Search Tree
- Kth node in Diagonal Traversal of Binary Tree
- Print cousins of a given node in Binary Tree | Single Traversal
- Create a binary tree from post order traversal and leaf node array
- Find the Kth node in the DFS traversal of a given subtree in a Tree
- Iterative Postorder Traversal of N-ary Tree
- Find postorder traversal of BST from preorder traversal
- Find the parent of a node in the given binary tree
- Find mirror of a given node in Binary tree
- Find the Deepest Node in a Binary Tree
- Find the Deepest Node in a Binary Tree Using Queue STL - SET 2
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.