 # Main Index Contents 11 Main Index Contents Week 6 – Binary Trees.

## Presentation on theme: "Main Index Contents 11 Main Index Contents Week 6 – Binary Trees."— Presentation transcript:

Main Index Contents 11 Main Index Contents Week 6 – Binary Trees

Sequence and Associative Containers Sequence containers access data by position 1.Array (index) 2.Vector (index) 3.List (iterator) Associate containers can access data by value 1.Set and Map / Binary search tree Arrays Vectors Linked lists Trees

Tree in Nature

Tree in our life Need to turn it upside down

Tree in Computer Science Similar to tree in nature Root Leaves

Main Index Contents 66 Main Index Contents Tree Structures Tree Structures Root Parent Child Edge Leaf Interior node Subtree Level Depth = max level

Terminologies used in Trees - Wiki

Main Index Contents 88 Main Index Contents Tree Node Level and Path Length What is the Depth?

Main Index Contents 9 Binary Tree Definition A binary tree T is a finite set of nodes with one of the following properties: – (a) T is a tree if the set of nodes is empty. (An empty tree is a tree, size=0.) – (b) The set consists of a root, R, and exactly two distinct binary trees, the left subtree T L and the right subtree T R. The nodes in T consist of node R and all the nodes in T L and T R. Any node in a binary tree has at most two children

Main Index Contents 10 Main Index Contents Selected Samples of Binary Trees Does tree B have left subtree T L ?

Density of a Binary Tree Intuitively, density is a measure of the size of a tree (number of nodes) relative to the depth of the tree. Trees with a higher density are important as data structures, because they can “pack” more nodes near the root. Access to the nodes is along relatively short paths from the root.

Complete binary tree

Degenerate tree A degenerate (or pathological) tree is where each parent node has only one associated child node. This means that performance-wise, the tree will behave like a linked list data structure.linked list

Evaluating Tree Density Complete binary trees are an ideal storage structure, because of their ability to pack a large number of nodes near the root Assume we want to store n elements in a complete binary tree. We would like to know the depth d of such a tree.

Depth d --- Size n in complete binary tree … ………………… … … level d has 2 d nodes 2 0 = 1 nodes 2 1 = 2 nodes Geometric series

Main Index Contents 17 Main Index Contents Binary Tree Nodes

Node class template { public: T nodeValue; tnode *left, *right; tnode() {} tnode(const T& item, tnode *lptr=NULL, tnode *rptr=NULL):nodeValue(item), left(lptr), right(rptr) {} };

Node structure

Building a Binary Tree A binary tree consists of a collection of dynamically allocated tnode objects whose pointer values specify links to their children.

Recursion Solution to a problem depends on solutions to smaller instances of the same problem. As a tree is a self-referential (recursively defined) data structure, traversal can naturally be described by recursion.recursion Recursive function: a function that calls itself. 21

BINARY TREE SCAN ALGORITHMS How to traverse the tree so that each node is visited exactly once? 1. Depth-first Pre-order In-order Post-order 2. Breadth-first (level-order)

Depth-first Defined as operations recursively at each node. The actions include:  visiting the node and performing some task (N),  making a recursive descent to the left subtree (L),  making a recursive descent to the right subtree (R). The different scanning strategies depend on the order in which we perform the tasks.

In-order Scan The prefix “in” comes from the fact that the visit occurs between the descents into the two subtrees. In this example, we use the order LNR. 1. Traverse the left subtree (“go left”). 2. Visit the node. 3. Traverse the right subtree (“go right”). L N R Recursively!

In-order example L N R L N R   Recursively! In-order scan: B, D, A, E, C  

In-order output

Post-order scan 1. Traverse the left subtree (“go left”). 2. Traverse the right subtree (“go right”). 3. Visit the node. 1. 3. 2. D, B, E, C, A

Post-order output

Pre-order scan 1. Visit the node. 2. Traverse the left subtree (“go left”). 3. Traverse the right subtree (“go right”). 2. 1. 3. A, B, D, C, E

Example Question F B CE I H DA G Pre-order? In-order? Post-order? Level-order ?

WIKI

Computing the Leaf Count Pre-order scan

Computing the Depth of a Tree Post-order scan

Deleting Tree Nodes Post-order scan