## 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

Objective: Given an undirected graph, Write an algorithm to determine whether its tree or not. An undirected graph is a … Read more

Objective: Given a binary tree, write an algorithm to determine whether the tree is complete or not using Level order … Read more

Objective: Given a binary tree, write an algorithm to determine whether the tree is complete or not. Complete Binary Tree: … Read more

Objective: Given a binary tree, write an algorithm to count all the nodes in the tree. Example: Approach: Do postorder … Read more

Objective: Given a binary tree write an algorithm to convert it into a threaded binary tree. Note: The tree node … Read more

In earlier article “Introduction to Threaded Binary Tree” we have seen what is threaded binary tree, types of it and … Read more

What is Threaded Binary Tree?? A binary tree is threaded by making all right child pointers that would normally be null point … Read more

Objective: Given a binary search tree (BST), convert it into greater sum tree. What is greater sum tree: Greater sum … Read more

Objective: Given a binary tree, find the sum of all the nodes which are left as well as leaves nodes. … Read more

Objective: Given a binary tree, write an algorithm to convert it into its Sum tree. What is a Sum tree: … Read more

Objective: Given a binary tree, write a non-recursive or iterative algorithm for postorder traversal. Example: Earlier we have seen “What … Read more

Objective: Given a binary tree, write a non-recursive or iterative algorithm for preorder traversal. Example: Earlier we have seen “What … Read more

Objective: Given a binary tree, write a non-recursive or iterative algorithm for Inorder traversal. Example: Earlier we have seen “What … Read more

Objective: Given a binary tree, write an algorithm to delete it. This is one of the basic problems in trees. … Read more