Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Tree traversal
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==External links== * [http://www.sitepoint.com/hierarchical-data-database/ Storing Hierarchical Data in a Database] with traversal examples in PHP * [https://web.archive.org/web/20110606032941/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://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] * [https://www.geeksforgeeks.org/tree-traversals-inorder-preorder-and-postorder/ Tree Traversal Algorithms] * [https://faculty.cs.niu.edu/~mcmahon/CS241/Notes/Data_Structures/binary_tree_traversals.html Binary Tree Traversal] * [https://www.simplilearn.com/tutorials/data-structure-tutorial/tree-traversal-in-data-structure Tree Traversal In Data Structure] {{Graph traversal algorithms}} {{DEFAULTSORT:Tree Traversal}} [[Category:Trees (data structures)]] [[Category:Articles with example pseudocode]] [[Category:Graph algorithms]] [[Category:Recursion]] [[Category:Iteration in programming]] [[de:Binärbaum#Traversierung]] [[ja:木構造 (データ構造)]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)