In computer science, tree traversalalso known as tree search) is a form of graph traversal , refers to the process of visitingchecking , updating) each.,

Dec 15, 2014 A while back I had an assignment to create a simple spell checker for an application The objective was fairly simple: determine if all the words in a text.

Techie Delight is a platform for technical interview contains huge collection of data structures , algorithms problems on various topics like arrays. We propose to learn Compact Binary Minutia Cylinder Code for fingerprint indexing We design an indexing scheme based on Multi Indexing Hashing in Hamming space

Jul 22, 2013 Problem link: Problem Statement: There is one friendly number. We can apply two approaches one is Recursive and other one is iterative queue based implementation Here i am going to explain both methods.

The method 2 of level order traversal post can be easily modified to check whether a tree is Complete or not To understand the approach, let us first define a term. Nov 19, 2013 Problem link: Problem Statement: It is easy to traverse a binary tree.

Breadth first searchBFS) is an algorithm for traversing or searching tree or graph data starts at the tree rootor some arbitrary node of a graph.