Check If Given Undirected Graph is a tree
Objective: Given an undirected graph, Write an algorithm to determine whether its tree or not. An undirected graph is a … Read more
Binary Tree
Check the completeness of given binary tree | Set 2 – Using Level Order Traversal
Objective: Given a binary tree, write an algorithm to determine whether the tree is complete or not using Level order … Read more
Check the completeness of given binary tree | Set 1 – Using Node Count
Objective: Given a binary tree, write an algorithm to determine whether the tree is complete or not. Complete Binary Tree: … Read more
Count the number of nodes in a given binary tree
Objective: Given a binary tree, write an algorithm to count all the nodes in the tree. Example: Approach: Do postorder … Read more
Convert Binary Tree into Threaded Binary Tree
Objective: Given a binary tree write an algorithm to convert it into a threaded binary tree. Note: The tree node … Read more
Double Threaded Binary Tree Complete Implementation
In earlier article “Introduction to Threaded Binary Tree” we have seen what is threaded binary tree, types of it and … Read more
Single Threaded Binary Tree Complete Implementation
In earlier article “Introduction to Threaded Binary Tree” we have seen what is threaded binary tree, types of it and … Read more
Introduction to Threaded Binary Tree
What is Threaded Binary Tree?? A binary tree is threaded by making all right child pointers that would normally be null point … Read more
Convert BST to Greater Sum Tree
Objective: Given a binary search tree (BST), convert it into greater sum tree. What is greater sum tree: Greater sum … Read more
Get the Sum of all left leaves in a Binary tree
Objective: Given a binary tree, find the sum of all the nodes which are left as well as leaves nodes. … Read more
Convert binary tree to its Sum tree
Objective: Given a binary tree, write an algorithm to convert it into its Sum tree. What is a Sum tree: … Read more
Binary Tree-Postorder Traversal – Non Recursive Approach
Objective: Given a binary tree, write a non-recursive or iterative algorithm for postorder traversal. Example: Earlier we have seen “What … Read more
Binary Tree – Preorder Traversal – Non Recursive Approach
Objective: Given a binary tree, write a non-recursive or iterative algorithm for preorder traversal. Example: Earlier we have seen “What … Read more
Binary Tree-Inorder Traversal – Non Recursive Approach
Objective: Given a binary tree, write a non-recursive or iterative algorithm for Inorder traversal. Example: Earlier we have seen “What … Read more
Delete the Binary Tree
Objective: Given a binary tree, write an algorithm to delete it. This is one of the basic problems in trees. … Read more