Given a binary tree. The task is to find the value of the deepest node in the given binary tree.
Examples:
Input: Root of below tree
1
/ \
2 3
/ \ / \
4 5 6 7
\
8
Output: 8
Input: Root of below tree
1
/ \
2 3
/
6
Output: 6
Approach: We have already discussed the two different ways to find the deepest node in a binary tree in this post. Here, we will find the deepest node in the tree using a queue data structure. We will first push the root into the queue and then we will push it’s child nodes after removing parent node from the queue. We will continue this process until the queue empty. The last node in the queue is the deepest node of the binary tree.
Below is the implementation of the above approach :
C++
// C++ program to find the value of the // deepest node in a given binary tree. #include <bits/stdc++.h> using namespace std; // A tree node struct Node { int data; struct Node *left , *right; }; // Utility function to create a new node Node *newNode(int data) { Node *temp = new Node; temp->data = data; temp->left = temp->right = NULL; return temp; } // Function to find the deepest node in a tree int findDeepest(struct Node* root) { struct Node* temp = NULL; queue <Node *> q; if(root == NULL) return 0; // Push the root node q.push(root); while(!q.empty()) { temp = q.front(); q.pop(); // Push left child if(temp->left) q.push(temp->left); // Push right child if(temp->right) q.push(temp->right); } // Return the deepest node's value return temp->data; } // Driver code int main() { Node* root = newNode(1); root->left = newNode(2); root->right = newNode(3); root->left->left = newNode(4); root->right->left = newNode(5); root->right->right = newNode(6); root->right->left->right = newNode(7); root->right->right->right = newNode(8); root->right->left->right->left = newNode(9); // Function call cout << findDeepest(root); return 0; } |
chevron_right
filter_none
Java
// Java program to find the value of the // deepest node in a given binary tree. import java.util.*; class GFG { // A tree node static class Node { int data; Node left , right; }; // Utility function to create a new node static Node newNode(int data) { Node temp = new Node(); temp.data = data; temp.left = temp.right = null; return temp; } // Function to find the deepest node in a tree static int findDeepest(Node root) { Node temp = null; Queue <Node> q = new LinkedList<Node>(); if(root == null) return 0; // Push the root node q.add(root); while(!q.isEmpty()) { temp = q.peek(); q.remove(); // Push left child if(temp.left!=null) q.add(temp.left); // Push right child if(temp.right!=null) q.add(temp.right); } // Return the deepest node's value return temp.data; } // Driver code public static void main(String[] args) { Node root = newNode(1); root.left = newNode(2); root.right = newNode(3); root.left.left = newNode(4); root.right.left = newNode(5); root.right.right = newNode(6); root.right.left.right = newNode(7); root.right.right.right = newNode(8); root.right.left.right.left = newNode(9); // Function call System.out.println(findDeepest(root)); } } // This code is contributed by 29AjayKumar |
chevron_right
filter_none
C#
// C# program to find the value of the // deepest node in a given binary tree. using System; using System.Collections.Generic; class GFG { // A tree node public class Node { public int data; public Node left , right; }; // Utility function to create a new node static Node newNode(int data) { Node temp = new Node(); temp.data = data; temp.left = temp.right = null; return temp; } // Function to find the deepest node in a tree static int findDeepest(Node root) { Node temp = null; Queue <Node> q = new Queue <Node>(); if(root == null) return 0; // Push the root node q.Enqueue(root); while(q.Count != 0) { temp = q.Peek(); q.Dequeue(); // Push left child if(temp.left != null) q.Enqueue(temp.left); // Push right child if(temp.right != null) q.Enqueue(temp.right); } // Return the deepest node's value return temp.data; } // Driver code public static void Main(String[] args) { Node root = newNode(1); root.left = newNode(2); root.right = newNode(3); root.left.left = newNode(4); root.right.left = newNode(5); root.right.right = newNode(6); root.right.left.right = newNode(7); root.right.right.right = newNode(8); root.right.left.right.left = newNode(9); // Function call Console.WriteLine(findDeepest(root)); } } // This code is contributed by PrinciRaj1992 |
chevron_right
filter_none
Output:
9
Time Complexity: O(N)
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.
Recommended Posts:
- Find the Deepest Node in a Binary Tree
- Deepest left leaf node in a binary tree
- Depth of the deepest odd level node in Binary Tree
- Deepest left leaf node in a binary tree | iterative approach
- Deepest right leaf node in a binary tree | Iterative approach
- Convert a Binary Tree to Threaded binary tree | Set 1 (Using Queue)
- Find depth of the deepest odd level leaf node
- Binary Tree to Binary Search Tree Conversion using STL set
- queue::empty() and queue::size() in C++ STL
- queue::push() and queue::pop() in C++ STL
- queue::front() and queue::back() in C++ STL
- Find maximum and minimum element in binary tree without using recursion or stack or queue
- Complexity of different operations in Binary tree, Binary Search Tree and AVL tree
- Right view of Binary Tree using Queue
- Check if a binary tree is subtree of another binary tree using preorder traversal : Iterative
- Check if a binary tree is subtree of another binary tree | Set 1
- Check if a binary tree is subtree of another binary tree | Set 2
- Convert a Binary Tree to Threaded binary tree | Set 2 (Efficient)
- Binary Tree | Set 3 (Types of Binary Tree)
- Find the node with minimum value in a Binary Search Tree using recursion
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.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.
