Main Article Content
Abstract
Graph is a data structure widely used now a day in different fields of computer science. It represents the relationship between one and more nodes. With the growth of internet technology social networking websites are also increased and to store the information about friends it require a graph. The intent of this paper is to propose a solution to optimize the storage of graph without using adjacency matrix. Efficient mapping of graph in the binary tree with some constraints is its goal.