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
2012
Highly Cited
2012
Design and management of flexible process variants using templates and rules
Highly Cited
2010
Highly Cited
2010
The Linkage Tree Genetic Algorithm
We introduce the Linkage Tree Genetic Algorithm (LTGA), a competent genetic algorithm that learns the linkage between the problem… 
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
2003
Highly Cited
2003
What was I looking for? The influence of task specificity and prior knowledge on students' search strategies in hypertext
Highly Cited
2000
Highly Cited
2000
ASPEN-Automated Planning and Scheduling for Space Mission Operation
This paper describes the ASPEN system for automation of planning and scheduling for space mission operations. 
1999
1999
Rendering on a budget: a framework for time-critical rendering
We present a technique for optimizing the rendering of high-depth complexity scenes. Prioritized-Layered Projection (PLP) does… 
Highly Cited
1993
Highly Cited
1993
Joint signal detection and parameter estimation in multiuser communications
The problem of simultaneously detecting the information bits and estimating signal amplitudes and phases in a K-user asynchronous… 
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… 
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)