An Inquistive Result on DFS Problem o f Binary Trees
Journal Title: International Journal of Scientific Research and Management - Year 2017, Vol 5, Issue 7
Abstract
Let be a complete binary tree of height ,then is called a full binary tree , if all the leaves in T are at level h. Let de note the full binary tree of height . Let denote the time taken by DFS with respect topreorder traversing to find the vertex in the graph . In this paper we analytically compute the for being a full binary tree of height , .
Authors and Affiliations
Dr. N. Rama
Food Safety - The Need Of The Hour
Access to sufficient a mount of safe and nutritious food is key to sustaining life and promoting good health. Unsafe food containing harmful viruses, parasites or chemicals cause more than 20...
A Probabilistic Inventory Model with Two-Parameter Exponential Deteriorating Rate and Pareto Demand Distribution
Although the deterioration is one of the main problems that have been investigated in the inventory systems science the last twenty years ago but Most deteriorating inventory studies focused on deterministic models. This...
Detection Techniques for Sybil Attack in MANETs
For detection of a Sybil attack, a traditiona l method defenses against attacks rely on trusted identities provided by a certification authority, but requiring users to present trusted identities run counter to the open...
Causes And Problems Of Population Displacement Of The Mishings Of Dhemaji Due To Flood Vulnerability
he Government has identified Dhemaji district as the most backward and poorest district in the State, mainly due to the fact that most portion of the area is affected by yearly floods. The population inhabited by differ...
Enhanced Scalability In Social Network Application Using Presence Service
Social network applications have become more and more in style on mobile devices. A mobile presence service is an important element of a social network application as a result of it maintains every mobile...