Table of Contents
If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions.
This is part of java binary tree tutorial.
In this post, we will see about Reverse Level Order binary tree traversal in java. In previous post, we have already seen Level order traversal. In reverse level order traversal, we will visit last level first, then second last and eventually first level.
Reverse Level Order traversal:
Reverse Level order traversal of below binary tree will be:
We will use stack  for Reverse Level Order traversal.
Steps for Reverse Level order traversal algorithm:
- Create empty
queueand push root node to it. - Do the following when queue is not empty
Popa node fromqueueand print itPush right childof popped node toqueueif not nullPush left childof popped node toqueueif not null- Push popped node to
stack
Popnode fromstackand print it
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 |
// prints in reverse level order public static void reverseLevelOrderTraversal(TreeNode startNode) { Queue<TreeNode> queue=new LinkedList<>(); Stack<TreeNode> stack=new Stack<>(); queue.add(startNode); while(!queue.isEmpty()) { TreeNode tempNode=queue.poll(); if(tempNode.right!=null) queue.add(tempNode.right); if(tempNode.left!=null) queue.add(tempNode.left); stack.push(tempNode); } while(!stack.empty()) System.out.print(stack.pop().data+" " ); } |
Lets say your binary tree is :
So Reverse Level Order traversal will work as below:
Lets create java program :
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 |
package org.arpit.java2blog.binarytree; import java.util.LinkedList; import java.util.Queue; import java.util.Stack; public class BinaryTreeReverseLevelOrder { public static class TreeNode { int data; TreeNode left; TreeNode right; TreeNode(int data) { this.data=data; } } // prints in reverse level order public static void reverseLevelOrderTraversal(TreeNode startNode) { Queue<TreeNode> queue=new LinkedList<>(); Stack<TreeNode> stack=new Stack<>(); queue.add(startNode); while(!queue.isEmpty()) { TreeNode tempNode=queue.poll(); if(tempNode.right!=null) queue.add(tempNode.right); if(tempNode.left!=null) queue.add(tempNode.left); stack.push(tempNode); } while(!stack.empty()) System.out.print(stack.pop().data+" " ); } public static void main(String[] args) { BinaryTreeReverseLevelOrder bi=new BinaryTreeReverseLevelOrder(); // Creating a binary tree TreeNode rootNode=createBinaryTree(); System.out.println("Reverse Level Order traversal of binary tree will be:"); reverseLevelOrderTraversal(rootNode); } public static TreeNode createBinaryTree() { TreeNode rootNode =new TreeNode(40); TreeNode node20=new TreeNode(20); TreeNode node10=new TreeNode(10); TreeNode node30=new TreeNode(30); TreeNode node60=new TreeNode(60); TreeNode node50=new TreeNode(50); TreeNode node70=new TreeNode(70); rootNode.left=node20; rootNode.right=node60; node20.left=node10; node20.right=node30; node60.left=node50; node60.right=node70; return rootNode; } } |
Run above program and you will get following output:
Reverse Level Order traversal of binary tree will be:
10 30 50 70 20 60 40
10 30 50 70 20 60 40
Java Binary tree tutorial
- Binary tree in java
- Binary tree preorder traversal
- Binary tree postorder traversal
- Binary tree inorder traversal
- Binary tree level order traversal
- Binary tree spiral order traversal
- Binary tree reverse level order traversal
- Binary tree boundary traversal
- Print leaf nodes of binary tree
- Count leaf nodes in binary tree
- get maximum element in binary tree
- Print all paths from root to leaf in binary tree
- Print vertical sum of binary tree in java
- Get level of node in binary tree in java
- Lowest common ancestor(LCA) in binary tree in java
Please go through java interview programs for more such programs.
Was this post helpful?
Let us know if this post was helpful. Feedbacks are monitored on daily basis. Please do provide feedback as that\'s the only way to improve.
Great post, thanks for writing this material
There is a small mistake, you have as a first step in algorithm “Pop a node from queue and print it”
I'm guessing that's a typo or copy and paste from level order traversal