Algorithms Interview Practice Basic – Breathe First Traversal In the iterative way You can only do breathe first traversal in iterative way. Though you can still make it recursive by calling itself in each loop, but you will not benefit from

app Interview Practice Extra 07 - Universal Value Binary Tree Question Design an algorithm to verify that a tree is a universal value binary tree. Universal value binary tree means all value in that tree is the same. Solution There is two approach

app Interview Practice 21 - Summing Combinations Question Given a integers m and n, generate all combination within 1 to n that would give the sum m. For example, for m=5 and n=5, the combinations are {5}, {4+

binary Interview Practice 11 - Greatest Distance Between Two Nodes in Binary Tree Question Get the greatest distance between two nodes in a binary tree. Assume links between nodes are bidirectional. Distance is defined as the amount of nodes connected along the path linked two nodes.

agent Find the User Agent Strings of any Mobile Devices It’s quite often for a developer to make use of the user agent to determine what browser does a user used, especially for those who develop web services and websites. Recently I