Skip to search formSkip to main contentSkip to account menu

Tree traversal

Known as: Inorder walk, Converse Postorder, Pre-order traversal 
In computer science, tree traversal (also known as tree search) is a form of graph traversal and refers to the process of visiting (checking and/or… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
AlphaGoAncestral reconstructionAnd–or treeArray data structure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Hierarchical cost effective leach for heterogeneous wireless sensor networks
  • R. AA. H
  • International Conference on Advanced Computing…
  • 2015
  • Corpus ID: 15492374
Wireless sensor networks are those that are used for the communication between various sensor nodes to the base station… 
Highly Cited
2012
Highly Cited
2012
Design and management of flexible process variants using templates and rules
Highly Cited
2010
Highly Cited
2010
Quasi-worlds and quasi-operators on quasi-triangulations
Highly Cited
2004
Highly Cited
2004
NUTSS: a SIP-based approach to UDP and TCP network connectivity
The communications establishment capability of the Session Initiation Protocol is being expanded by the IETF to include… 
Highly Cited
2000
Highly Cited
2000
Sensor Optimization for Fault Diagnosis in Multi-Fixture Assembly Systems With Distributed Sensing
Sensing for the system-wide diagnosis of dimensional faults in multi-fixture sheet metal assembly presents significant issues of… 
Highly Cited
2000
Highly Cited
2000
IGRAINE-an Implication GRaph-bAsed engINE for fast implication, justification, and propagation
Implication, justification, and propagation are three important Boolean problems that have to be solved during many tasks in… 
1991
1991
Optimization of Nonrecursive Queries in OODBs
An important problem of OODB query optimization is to perform efficiently path traversals expressed in queries involving complex… 
1986
1986
An Experimental Comparison of a Mouse and Arrow-Jump Keys for an Interactive Encyclopedia
Highly Cited
1985
Highly Cited
1985
An Optimal Admissible Tree Search
!The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is known… 
Highly Cited
1974
Highly Cited
1974
Allocating Storage for Extendible Arrays
Arrays are among the best understood and most widely used data structures. Yet even now, there are no satisfactory techniques for… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)