A New Look to Traversal Algorithms Using Set Construct Data Structure

Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 5

Abstract

Tree traversal refers to the process of visiting or examining or updating each node in a tree data structure, exactly once, in a systematic way. Such traversals are classified by the order in which the nodes of the tree are visited. This paper presents a new and innovative technique using which raversing in trees as well as in graph becomes extremely easy and using this technique explanation & understanding of traversing in trees & graphs also becomes easy using set construct.

Authors and Affiliations

Vineet Kumar Sharma , Adesh Kumar Pandey , Dr. V. K. Srivastava

Keywords

Related Articles

A Context-Dependent Trust Model for the MAC Layer in LR-WPANs

Low rate wireless personal networks are vulnerable to several attacks focused on the Media Access Layer. Malicious or faulty nodes can subvert CSMA/CA and GTS allocation algorithms, achieving MAC unfairness in order to o...

Query Optimization on Compressed and Decompressed Object-Oriented Database Using Operators

In this paper, we present an approach using various database operators that permits to enrich technique of query ptimization existing in the objectoriented databases and the comparative analysis of query optimization of...

Performance Evaluation of IEEE 802.11b/n in Wireless Networks for QoS Improvement

The development of technology in the wireless communication domain has enhanced the need for power optimization schemes, because the battery technology has not kept up pace with the ever increasing growth of mobile devic...

Power and Delay Aware On-Demand Routing For Ad Hoc Networks

Wide implementation of IEEE 802.11 based networks could ead to deployment of localized wireless data communication environments with a limited number of mobile hosts, called ad hoc networks. Implementation of a proper r...

Approaches for Managing and Analyzing Unstructured Data

Large volumes of data that will be stored and accessed in future is unstructured. The unstructured data is generated in a very fast pace and uses large storage areas. This increases the storage budget. Extracting value f...

Download PDF file
  • EP ID EP144990
  • DOI -
  • Views 95
  • Downloads 0

How To Cite

Vineet Kumar Sharma, Adesh Kumar Pandey, Dr. V. K. Srivastava (2010). A New Look to Traversal Algorithms Using Set Construct Data Structure. International Journal on Computer Science and Engineering, 2(5), 1445-1448. https://europub.co.uk/articles/-A-144990