Given a binary tree and value k. delete all the leaf nodes with value equal to k. If a node becomes leaf after deletion, then it should be deleted if it has value k.
Input : 4 / \ 5 5 / \ / 3 1 5 Output : 4 / 5 / \ 3 1
1. Use PostOrder traversal.
2. When we encounter leaf nodes, then we check whether it is leaf node or not.
3. If it is leaf node and value equal to k, then delete it.
4. Else, Recurse for other nodes.
Nodes in postorder before deletion 4 5 3 1 5 5 Nodes in post order after required deletion 4 5 3 1
- Delete leaf nodes with value as x
- Delete the last leaf node in a Binary Tree
- Delete N nodes after M nodes of a linked list
- Print all leaf nodes of an n-ary tree using DFS
- Sum of all leaf nodes of binary tree
- Sum of leaf nodes at minimum level
- Print Leaf Nodes at a given Level
- Print all nodes that are at distance k from a leaf node
- Determine the count of Leaf nodes in an N-ary tree
- Product of all leaf nodes of binary tree
- Count Non-Leaf nodes in a Binary Tree
- Print all leaf nodes of a binary tree from right to left
- Print the nodes of binary tree as they become the leaf node
- Remove nodes on root to leaf paths of length < K
- Root to leaf path with maximum distinct nodes
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.
Improved By : 29AjayKumar