Left to right sibling reference in tree data structure to reduce space allocation

In computers data structures is the formal way to store or represent any data for its efficient use. Tree is a hierarchical data structure. Tree data structure is commonly used for various problems. Trees are a special case of graph data structure in which each node has a definite number of nodes (children) connected to it. This paper presents a modified binary tree called Richard tree. In a Richard tree each node can form a relation with its sibling node which in turn provides a storage alternative during breadth first search. Here L (Left) to R (Right) is used for embedding address from left to right node at the same level to reduce the space allocation.