|
|
| Line 1: |
Line 1: |
| {{refimprove|date=May 2009}}
| | In front of playing a new digital video game, read the take advantage of book. Most on-line games have a book a person can purchase separately. You may want to consider doing this and as well reading it before anyone play, or even when you are you are playing. This way, you also can get the most on the market of your game adventure.<br><br>The underside line is, this happens to be worth exploring if you want strategy games, especially should you be keen on Clash related with Clans. Want to know what opinions you possess, when you do.<br><br>When you find yourself getting a online game for your little one, look for one understanding that enables numerous customers to perform with each other. Video gaming can regarded as a solitary action. Nevertheless, it is important to motivate your youngster growing to be social, and multi-player clash of clans hack is capable to complete that. They enable sisters and brothers but buddies to all among take a moment as laugh and compete jointly.<br><br>A maximum of now, there exists no [http://www.thefreedictionary.com/social+options social options] / functions with this game that i.e. there is not any chat, struggling to team track linked with friends, etc but greatest choice we could expect all of this to improve soon as compared to Boom Beach continues to be in their Beta Mode.<br><br>Supercell has absolutely considerable moreover explained the steps amongst Association Wars, the over appear passion in Conflict of Clans. As your name recommends, a association war is often a strategic battle amid a couple of clans. It assumes abode over the introduction of two canicule -- this alertness day plus a action day -- while the acceptable association that includes a ample boodle bonus; although, every association affiliate whom makes acknowledged attacks following a association war additionally to produce some benefit loot.<br><br>Will you perform online multi-player game titles, don't carelessness the strength of tone of voice chat! A mic or headphones is a very simple expenditure, and having the main capability to speak to finally your fellow athletes makes a lot of pays. You are confident to create more powerful connections with the community and stay some far more successful group person when you are able connect out high in volume.<br><br>There are a few try interpreting the abstracts differently. Anticipate of it in agreement of bulk with jewelry to skip 1 extra. If you beloved this post and you would like to acquire additional details regarding [http://circuspartypanama.com clash of clans hack android] kindly visit our own webpage. Skipping added moments expenses added money, but you get a more prominent deal. Think of it as a variety accretion discounts. |
| | |
| {{graph search algorithm}}
| |
| | |
| In [[computer science]], '''tree traversal''' (also known as '''tree search''') refers to the process of visiting (examining and/or updating) each node in a [[tree (data structure)|tree data structure]], exactly once, in a systematic way. Such traversals are classified by the order in which the nodes are visited. The following algorithms are described for a [[binary tree]], but they may be generalized to other trees as well. | |
| | |
| == Types==
| |
| [[File:Sorted binary tree preorder.svg|thumb|Pre-order: F, B, A, D, C, E, G, I, H]]
| |
| [[File:Sorted binary tree inorder.svg|thumb|In-order: A, B, C, D, E, F, G, H, I]]
| |
| [[File:Sorted binary tree postorder.svg|thumb|Post-order: A, C, E, D, B, H, I, G, F]]
| |
| [[File:Sorted binary tree breadth-first traversal.svg|thumb|Level-order: F, B, G, A, D, I, C, E, H]]
| |
| Compared to [[List of data structures#Linear data structures|linear data structures]] like [[linked list]]s and one dimensional [[Array data structure|arrays]], which have a canonical method of traversal (namely in linear order), tree structures can be traversed in many different ways. Starting at the root of a binary tree, there are three main steps that can be performed and the order in which they are performed defines the traversal type. These steps (in no particular order) are: performing an action on the current node (referred to as "visiting" the node), traversing to the left child node, and traversing to the right child node.
| |
| | |
| Traversing a tree involves iterating (looping) over all nodes in some manner. Because from a given node there is more than one possible next node (it is not a linear data structure), then, assuming sequential computation (not parallel), some nodes must be deferred – stored in some way for later visiting. This is often done via a [[Stack (abstract data type)|stack]] (LIFO) or [[Queue (abstract data type)|queue]] (FIFO). As a tree is a self-referential (recursively defined) data structure, traversal can naturally be described by [[recursion]] or, more subtly, [[corecursion]], in which case the deferred nodes are stored implicitly – in the case of recursion, in the [[call stack]].
| |
| | |
| The name given to a particular style of traversal comes from the order in which nodes are visited. Most simply, does one go down first (depth-first: first child, then grandchild before second child) or across first (breadth-first: first child, then second child before grandchildren)? Depth-first traversal is further classified by position of the root element with regard to the left and right nodes. Imagine that the left and right nodes are constant in space, then the root node could be placed to the left of the left node (pre-order), between the left and right node (in-order), or to the right of the right node (post-order). There is no equivalent variation in breadth-first traversal – given an ordering of children, "breadth-first" is unambiguous.
| |
| | |
| For the purpose of illustration, it is assumed that left nodes always have priority over right nodes. This ordering can be reversed as long as the same ordering is assumed for all traversal methods.
| |
| | |
| Depth-first traversal is easily implemented via a stack, including recursively (via the call stack), while breadth-first traversal is easily implemented via a queue, including corecursively.
| |
| | |
| Beyond these basic traversals, various more complex or hybrid schemes are possible, such as [[depth-limited search]]es such as [[iterative deepening depth-first search]].
| |
| | |
| ===Depth-first===
| |
| {{see also|Depth-first search}}
| |
| There are three types of depth-first traversal: pre-order,<ref name="holtenotes">http://webdocs.cs.ualberta.ca/~holte/T26/tree-traversal.html</ref> in-order,<ref name="holtenotes"/> and post-order.<ref name="holtenotes"/> For a binary tree, they are defined as operations recursively at each node, starting with the root node as follows:
| |
| | |
| ==== Pre-order ====
| |
| # Visit the root.
| |
| # Traverse the left subtree.
| |
| # Traverse the right subtree.
| |
| | |
| ==== {{anchor|In-order}} In-order (symmetric) ====
| |
| # Traverse the left subtree.
| |
| # Visit the root.
| |
| # Traverse the right subtree.
| |
| | |
| ==== Post-order ====
| |
| # Traverse the left subtree.
| |
| # Traverse the right subtree.
| |
| # Visit the root.
| |
| | |
| The trace of a traversal is called a sequentialisation of the tree. No one sequentialisation according to pre-, in- or post-order describes the underlying tree uniquely. Given a tree with distinct elements, either pre-order or post-order paired with in-order is sufficient to describe the tree uniquely. However, pre-order with post-order leaves some ambiguity in the tree structure.<ref>[http://cs.stackexchange.com/questions/439/which-combinations-of-pre-post-and-in-order-sequentialisation-are-unique Which combinations of pre-, post- and in-order sequentialisation are unique?]</ref> | |
| | |
| ====Generic tree====
| |
| To traverse any tree in '''depth-first order''', perform the following operations recursively at each node:
| |
| # Perform pre-order operation
| |
| # For each ''i'' (with ''i'' = 1 to ''n'' − 1) do:
| |
| ## Visit ''i''-th, if present
| |
| ## Perform in-order operation
| |
| # Visit ''n''-th (last) child, if present
| |
| # Perform post-order operation
| |
| | |
| where ''n'' is the number of child nodes. Depending on the problem at hand, the pre-order, in-order or post-order operations may be void, or you may only want to visit a specific child node, so these operations are optional. Also, in practice more than one of pre-order, in-order and post-order operations may be required. For example, when inserting into a ternary tree, a pre-order operation is performed by comparing items. A post-order operation may be needed afterwards to re-balance the tree.
| |
| | |
| ===Breadth-first===
| |
| {{see also|Breadth-first search}}
| |
| Trees can also be traversed in '''level-order''', where we visit every node on a level before going to a lower level.
| |
| | |
| == Applications ==
| |
| Pre-order traversal while duplicating nodes and values can make a complete duplicate of a [[binary tree]]. It can also be used to make a prefix expression ([[Polish notation]]) from [[Parse tree|expression trees]]: traverse the expression tree pre-orderly.
| |
| | |
| In-order traversal is very commonly used on [[binary search tree]]s because it returns values from the underlying set in order, according to the comparator that set up the binary search tree (hence the name).
| |
| | |
| Post-order traversal while deleting or freeing nodes and values can delete or free an entire binary tree. It can also generate a [[Reverse Polish notation|postfix]] representation of a binary tree.
| |
| | |
| ==Implementations==
| |
| {{unreferenced section|date=June 2013}}
| |
| | |
| ===Depth-first===
| |
| | |
| ====Pre-order====
| |
| {|
| |
| |-valign="top"
| |
| |
| |
| '''preorder'''(node)
| |
| '''if''' node == '''null then return'''
| |
| visit(node)
| |
| preorder(node.left)
| |
| preorder(node.right)
| |
| |
| |
| '''iterativePreorder'''(node)
| |
| parentStack = '''empty stack'''
| |
| parentStack.push( node )
| |
| '''while (not''' parentStack.isEmpty() )
| |
| node = parentStack.pop();
| |
| if( node != null )
| |
| visit(node)
| |
| parentStack.push(node.right)
| |
| parentStack.push(node.left)
| |
| | |
| |}
| |
| | |
| ====In-order====
| |
| {|
| |
| |-valign="top"
| |
| |
| |
| '''inorder'''(node)
| |
| '''if''' node == '''null then return'''
| |
| inorder(node.left)
| |
| visit(node)
| |
| inorder(node.right)
| |
| |
| |
| '''iterativeInorder'''(node)
| |
| parentStack = '''empty stack'''
| |
| '''while''' ('''not''' parentStack.isEmpty() '''or''' node ≠ '''null''')
| |
| '''if''' (node ≠ '''null''')
| |
| parentStack.push(node)
| |
| node = node.left
| |
| '''else'''
| |
| node = parentStack.pop()
| |
| visit(node)
| |
| node = node.right
| |
| |}
| |
| | |
| ====Post-order====
| |
| {|
| |
| |-valign="top"
| |
| |
| |
| '''postorder'''(node)
| |
| '''if''' node == '''null then return'''
| |
| postorder(node.left)
| |
| postorder(node.right)
| |
| visit(node)
| |
| |
| |
| '''iterativePostorder'''(node)
| |
| parentStack = '''empty stack'''
| |
| lastnodevisited = '''null'''
| |
| '''while''' ('''not''' parentStack.isEmpty() '''or''' node ≠ '''null''')
| |
| '''if''' (node ≠ '''null''')
| |
| parentStack.push(node)
| |
| node = node.left
| |
| '''else'''
| |
| peeknode = parentStack.peek()
| |
| '''if''' (peeknode.right ≠ '''null''' '''and''' lastnodevisited ≠ peeknode.right)
| |
| /* if right child exists AND traversing node from left child, move right */
| |
| node = peeknode.right
| |
| '''else'''
| |
| parentStack.pop()
| |
| visit(peeknode)
| |
| lastnodevisited = peeknode
| |
| | |
| |}
| |
| All the above implementations require [[call stack]] space proportional to the height of the tree. In a poorly balanced tree, this can be considerable. We can remove the stack requirement by maintaining parent pointers in each node, or by [[#Threading and Morris in-order traversal|threading the tree]] (next section).
| |
| | |
| ====Morris in-order traversal using threading====
| |
| | |
| A binary tree is [[threaded binary tree|threaded]] by making every left child pointer point to the in-order predecessor of the node and every right child pointer point to the in-order successor of the node.
| |
| | |
| Advantages:
| |
| # Avoids recursion, which uses a call stack and consumes memory and time.
| |
| # The node keeps a record of its parent.
| |
| | |
| Disadvantages:
| |
| # The tree is more complex.
| |
| # It is more prone to errors when both the children are not present and both values of nodes point to their ancestors.
| |
| | |
| Morris traversal is an implementation of in-order traversal that uses threading:
| |
| # Create links to the in-order successor
| |
| # Print the data using these links
| |
| # Revert the changes to restore original tree.
| |
| | |
| ===Breadth-first===
| |
| | |
| Also, listed below is pseudocode for a simple [[queue (data structure)|queue]] based level order traversal, and will require space proportional to the maximum number of nodes at a given depth. This can be as much as the total number of nodes / 2. A more space-efficient approach for this type of traversal can be implemented using an [[iterative deepening depth-first search]].
| |
| | |
| '''levelorder'''(root)
| |
| q = empty queue
| |
| q.enqueue(root)
| |
| '''while''' not q.empty '''do'''
| |
| node := q.dequeue()
| |
| visit(node)
| |
| '''if''' node.left ≠ '''null then'''
| |
| q.enqueue(node.left)
| |
| '''if''' node.right ≠ '''null then'''
| |
| q.enqueue(node.right)
| |
| | |
| ==Infinite trees==
| |
| | |
| While traversal is usually done for trees with a finite number of nodes (and hence finite depth and finite [[branching factor]]) it can also be done for infinite trees. This is of particular interest in [[functional programming]] (particularly with [[lazy evaluation]]), as infinite data structures can often be easily defined and worked with, though they are not (strictly) evaluated, as this would take infinite time. Some finite trees are too large to represent explicitly, such as the [[game tree]] for [[chess]] or [[Go (game)|go]], and so it is useful to analyze them as if they were infinite.
| |
| | |
| A basic requirement for traversal is to visit every node. For infinite trees, simple algorithms often fail this. For example, given a binary tree of infinite depth, a depth-first traversal will go down one side (by convention the left side) of the tree, never visiting the rest, and indeed if in-order or post-order will never visit ''any'' nodes, as it has not reached a leaf (and in fact never will). By contrast, a breadth-first (level-order) traversal will traverse a binary tree of infinite depth without problem, and indeed will traverse any tree with bounded branching factor.
| |
| | |
| On the other hand, given a tree of depth 2, where the root node has infinitely many children, and each of these children has two children, a depth-first traversal will visit all nodes, as once it exhausts the grandchildren (children of children of one node), it will move on to the next (assuming it is not post-order, in which case it never reaches the root). By contrast, a breadth-first traversal will never reach the grandchildren, as it seeks to exhaust the children first.
| |
| | |
| A more sophisticated analysis of running time can be given via infinite [[ordinal number]]s; for example, the breadth-first traversal of the depth 2 tree above will take ?·2 steps: ? for the first level, and then another ? for the second level.
| |
| | |
| Thus, simple depth-first or breadth-first searches do not traverse every infinite tree, and are not efficient on very large trees. However, hybrid methods can traverse any (countably) infinite tree, essentially via a [[Diagonal argument (disambiguation)|diagonal argument]] ("diagonal" – a combination of vertical and horizontal – corresponds to a combination of depth and breadth).
| |
| | |
| Concretely, given the infinitely branching tree of infinite depth, label the root node <math>(),</math> the children of the root node <math>(1), (2), \dots,</math> the grandchildren <math>(1,1), (1,2), \ldots, (2,1), (2,2), \ldots,</math> and so on. The nodes are thus in a [[bijection|one-to-one]] correspondence with finite (possibly empty) sequences of positive numbers, which are countable and can be placed in order first by sum of entries, and then by [[lexicographic order]] within a given sum (only finitely many sequences sum to a given value, so all entries are reached – formally there are a finite number of [[Composition (number theory)|compositions]] of a given natural number, specifically 2<sup>''n''-1</sup>compositions of ''n'' = 1;), which gives a traversal. Explicitly:
| |
| | |
| 0: ()
| |
| 1: (1)
| |
| 2: (1,1) (2)
| |
| 3: (1,1,1) (1,2) (2,1) (3)
| |
| 4: (1,1,1,1) (1,1,2) (1,2,1) (1,3) (2,1,1) (2,2) (3,1) (4)
| |
| | |
| etc.
| |
| | |
| This can be interpreted as mapping the infinite depth binary tree onto this tree and then applying breadth-first traversal: replace the "down" edges connecting a parent node to its second and later children with "right" edges from the 1st child to the 2nd child, 2nd child to third child, etc. Thus at each step one can either go down (append a (,1) to the end) or go right (add 1 to the last number) (except the root, which is extra and can only go down), which shows the correspondence between the infinite binary tree and the above numbering; the sum of the entries (minus 1) corresponds to the distance from the root, which agrees with the 2<sup>''n''-1</sup> nodes at depth ''n''-1 in the infinite binary tree (2 corresponds to binary).
| |
| | |
| == References ==
| |
| {{Reflist}}
| |
| | |
| ; General
| |
| * Dale, Nell. Lilly, Susan D. "Pascal Plus Data Structures". D. C. Heath and Company. Lexington, MA. 1995. Fourth Edition.
| |
| * Drozdek, Adam. "Data Structures and Algorithms in C++". Brook/Cole. Pacific Grove, CA. 2001. Second edition.
| |
| * http://www.math.northwestern.edu/~mlerma/courses/cs310-05s/notes/dm-treetran
| |
| | |
| == External links ==
| |
| * [http://www.cosc.canterbury.ac.nz/people/mukundan/dsal/BTree.html Animation Applet of Binary Tree Traversal]
| |
| * [http://www.SQLSummit.com/AdjacencyList.htm The Adjacency List Model for Processing Trees with SQL]
| |
| * [http://www.sitepoint.com/hierarchical-data-database/ Storing Hierarchical Data in a Database] with traversal examples in PHP
| |
| * [http://dev.mysql.com/tech-resources/articles/hierarchical-data.html Managing Hierarchical Data in MySQL]
| |
| * [http://www.artfulsoftware.com/mysqlbook/sampler/mysqled1ch20.html Working with Graphs in MySQL]
| |
| * [http://www.jslab.dk/articles/non.recursive.preorder.traversal Non-recursive traversal of DOM trees in JavaScript]
| |
| * [http://code.google.com/p/treetraversal/ Sample code for recursive and iterative tree traversal implemented in C.]
| |
| * [http://arachnode.net/blogs/programming_challenges/archive/2009/09/25/recursive-tree-traversal-orders.aspx Sample code for recursive tree traversal in C#.]
| |
| * [http://rosettacode.org/wiki/Tree_traversal See tree traversal implemented in various programming language] on [[Rosetta Code]]
| |
| * [http://www.perlmonks.org/?node_id=600456 Tree traversal without recursion]
| |
| | |
| {{DEFAULTSORT:Tree Traversal}}
| |
| [[Category:Trees (data structures)]]
| |
| [[Category:Articles with example Haskell code]]
| |
| [[Category:Articles with example Java code]]
| |
| [[Category:Articles with example pseudocode]]
| |
| [[Category:Graph algorithms]]
| |
| [[Category:Recursion]]
| |
| [[Category:Iteration in programming]]
| |
| | |
| [[de:Binärbaum#Traversierung]]
| |
| [[ja:木構造 (データ構造)]]
| |
| [[zh:树的遍历]]
| |