Implement the Depth First Search Algorithm in Graph using Simple C/C++
Given a graph represented by G(V, E) where V is the vertices and E represents the edges, we can do a Depth First Search Algorithm (DFS) on any node/vertex. …
Tag: recursion
Comparing Left and Right Branch of a Complete Binary Tree
A complete binary tree is a binary tree that each level except possibiliy the last level, is completed filled. Suppose you are giving a binary tree represented as an …
The Subsequence Algorithm for Two Strings – How to Check if a String is Subsequence of Another?
Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s …
The 24 Game Algorithm using Depth First Search
You have 4 cards each containing a number from 1 to 9. You need to judge whether they could operated through *, /, +, -, (, ) to get …
The Maximum Average Subtree of a Binary Tree
Given the root of a binary tree, find the maximum average value of any subtree of that tree. (A subtree of a tree is any node of that tree …