Prototyping 21 May 2013
- Tree
- Walking a tree
- Recursive traversal
- Depth-first traversal
- Breadth-first traversal
Tree
A tree, in a computer science sense, is a hierarchical representation and means of accessing information. It's used in relation to:
- File systems (folders and files)
- "Decision trees" used to classify / sort
- 3D graphics (for efficiently drawing surfaces in a realistic way)
- Documents, such as a web page (via ElementTree)
ElementTree
From the documentation:
Each element has a number of properties associated with it:
- a tag which is a string identifying what kind of data this element represents (the element type, in other words).
- a number of attributes, stored in a Python dictionary.
- a text string.
- an optional tail string.
- a number of child elements, stored in a Python sequence
To create an element instance, use the Element constructor or the SubElement() factory function.
http://docs.python.org/2/library/xml.etree.elementtree.html
ElementTree
In an ElementTree the fundamental unit is the "Element"
An Element has:
- .tag (a string representing the name of the tag, like "p" or "script")
- .attrib (a "dictionary" with name=value pairs of the tag attributes, like id="foo", or style="color: blue")
- .text (String of text contents of the node)
- .tail (if there's text after child tags, it'd be here)
In addition (and this is why it's a tree), each element can be iterated / treated like a list of all sub-elements.
- Iteration to access contained "child" elements
Tree Traversal
http://en.wikipedia.org/wiki/Tree_traversal
File:Sorted binary tree preorder.svgFile:Sorted binary tree breadth-first traversal.svg
Walking the tree
def walk (node):
print node.tag
for child in node:
walk(child)
Cherry picking
(collecting things while walking the tree)
... example to follow ...