Trees
Trees are hierarchical data structures that have various applications in robotics and computer vision. They consist of nodes connected by edges, with a single node called the root that serves as the starting point for traversing the tree.
Each node in a tree contains a value and may have child nodes connected to it. Nodes that have no child nodes are called leaf nodes, while nodes with child nodes are called internal nodes.
Trees provide an efficient way to represent hierarchical relationships between data. For example, in computer vision, trees can be used to model object hierarchies, such as the parts of a robot.
Here is an example of a basic tree implementation in Python:
PYTHON
1# Node class to represent a node in a tree
2
3class Node:
4 def __init__(self, value):
5 self.value = value
6 self.left = None
7 self.right = None
8
9# Create a tree function
10
11def create_tree():
12 root = Node(1)
13 root.left = Node(2)
14 root.right = Node(3)
15 root.left.left = Node(4)
16 root.left.right = Node(5)
17 root.right.left = Node(6)
18 root.right.right = Node(7)
19 return root
20
21# Preorder traversal function
22
23def preorder(root):
24 if root:
25 print(root.value)
26 preorder(root.left)
27 preorder(root.right)
28
29# Create a tree
30
31tree = create_tree()
32
33# Perform preorder traversal
34
35preorder(tree)xxxxxxxxxx35
preorder(tree)# Node class to represent a node in a treeclass Node: def __init__(self, value): self.value = value self.left = None self.right = None# Create a treedef create_tree(): root = Node(1) root.left = Node(2) root.right = Node(3) root.left.left = Node(4) root.left.right = Node(5) root.right.left = Node(6) root.right.right = Node(7) return root# Preorder traversal functiondef preorder(root): if root: print(root.value) preorder(root.left) preorder(root.right)# Create a treeOUTPUT
:001 > Cmd/Ctrl-Enter to run, Cmd/Ctrl-/ to comment
