Trees 1
Trees 1
Examples of Tree structures Definition of trees Binary tree Height of a tree Tree traversals Finding sum of all elements Finding maximum value
Trees
You have seen that using linked lists you can represent an ordered collection of values without using arrays. Although linked lists require more memory space than arrays ( as they have to store address at each node), they have definite advantages over arrays. Insertion and deletion of items can be carried out with out involving considerable movement of data. The ordering relationship amongst a set of values is obtained through use of pointers. However, we need not restrict ourselves to only linear structures. In this chapter we shall extend the use of pointers to define a non-linear structure to model hierarchical relationships, such as a family tree. In such a tree, we have links moving from an ancestor to a parent, and links moving from the parent to children. We have many other examples of tree-structured hierarchies. Directory Hierarchies: In computers, files are stored in directories that form a tree. The top level directory represents the root. It has many subdirectories and files. The subdirectories would have further set of subdirectories. Organization charts: In a company a number of vice presidents report to a president. Each VP would have a set of general managers, each GM having his/her own set of specific managers and so on. Biological classifications: Starting from living being at the root, such a tree can branch off to mammals, birds, marine life etc. Game Trees: All games which require only mental effort would always have number of possible options at any position of the game. For each position, there would be number of counter moves. The repetitive pattern results in what is known a game tree.
The top node in the tree is called the root and all other nodes branch off from this one.
Every node in the tree can have some number of children. Each child node can in turn be the parent node to its children and so on. Child nodes can have links only from a single parent. Any node higher up than the parent is called an ancestor node. Nodes having no children are called leaves. Any node which is neither a root, nor a leaf is called an interior node. The height of a tree is defined to be the length of the longest path from the root to a leaf in that tree ( including the path to root)
Binary Trees
A common example of a tree structure is the binary tree. Definition: A binary tree is a tree in which each node can have maximum two children. Thus each node can have no child, one child or two children. The pointers help us to identify whether it is a left child or a right child.
Let us see if we can improve the situation by storing the data using a binary tree structure. Consider the following binary tree where the numbers have been stored in a specific order. The value at any node is more than the values stored in the left-child nodes, and less than the values stored in the right-child nodes.
59
18
67
13
32
63
72
25
With this arrangement any search is taking at most 4 steps. For larger set of numbers, if we can come up with a good tree arrangement than the search time can be reduced dramatically.
The level of a node in a binary tree: - The root of the tree has level 0 - The level of any other node in the tree is one more than the level of its parent.
root
Level 0
Level 1 Level 2
Level 3
45
24
76
14
32
61
87
20
27
56 37
67
81
94
How many nodes? Level 0 : 1 node Level 1: 2 nodes Level 2 : 4 nodes Level 3: 8 nodes Total number of nodes for this tree = 15 Height of the root node = 4 n = 24 1 = 15 In general, n = 2h 1 ( maximum)
Maximum Number of nodes in a tree with height h = 2h 1 Height of a tree with n nodes : h = log ( n+1)
Implementation
A binary tree has a natural implementation in linked storage. A tree is referenced with a pointer to its root. Recursive definition of a binary tree: A binary tree is either - Empty, or - A node (called root) together with two binary trees (called left subtree and the right subtree of the root)
Each node of a binary tree has both left and right subtrees which can be reached with pointers: struct tree_node{ int data; struct tree_node *left_child; struct tree_node *right_child; };
left_child data
right_child
Note the recursive definition of trees. A tree is a node with structure that contains more trees. We have actually a tree located at each node of a tree.
These names are chosen according to the sequence in which the root node and its children are visited. Suppose there are only 3 nodes in the tree having the following arrangement:
n1
n2
n3
With inorder traversal the order is left-child, root node, right-child With preorder traversal the order is root node, left child , right child. With postorder traversal the order is left child, right child, root node.
A tree will typically have more than 3 nodes. Instead of nodes n2 and n3 there would be subtrees as shown below:
root
Left subtree
Right subtree
With inorder traversal the order is left subtree, then the root and finally the right subtree. Thus the root is visited in-between visiting the left and right subtrees. With preorder traversal the root node is visited first, then the nodes in the left subtree are visited followed by the nodes in the right subtrees With postorder traversal the root is visited after both the subtrees have been visited.(left subtree followed by right subtree.
As the structure of a binary tree is recursive, the traversal algorithms are inherently recursive.
10
root
a c
f
Preorder Traversal : a(root) abcdfge b(left)
c d f g e (right)
11
root
a c
f
Inorder: b(left) a(root) f d g c e(right) bafdgce
12
13