Lab 11: Implementation of The BINARY SEARCH TREE Data Structure With The Help of Algorithms

CSC-221: Data Structures &
Alogrithms
Semester BS CS – 03
Lab 11: Implementation of the BINARY SEARCH TREE data structure

with the help of algorithms
Introduction to :
1. BINARY SEARCH TREE structure representation
2. Creation of Binary Search Tree
3. Traversing over Binary Search Tree
Binary Tree
We extend the concept of linked data structures to structure containing nodes with more than one
self-referenced field. A binary tree is made of nodes, where each node contains a "left" reference,
a "right" reference, and a data element. The topmost node in the tree is called the root.
Every node (excluding a root) in a tree is connected by a directed edge from exactly one other
node. This node is called a parent. On the other hand, each node can be connected to arbitrary
number of nodes, called children. Nodes with no children are called leaves, or external nodes.
Nodes which are not leaves are called internal nodes. Nodes with the same parent are called
siblings.
Binary Search Tree
First of all, binary search tree (BST) is a dynamic data structure, which means, that its size is only
limited by amount of free memory in the operating system and number of elements may vary
during the program run. Main advantage of binary search trees is rapid search, while addition is
quite cheap. Let us see more formal definition of BST.
Binary search tree is a data structure, which meets the following requirements:
 it is a binary tree;
 each node contains a value;
 a total order is defined on these values (every two values can be compared with each
other);
Department of Computer Sciences 1/4 Semester BSCS 3
CSC-221 Data Structures & Algorithms Lab 11: Implementation of the BINARY SEARCH TREE
data structure with the help of algorithms
 left subtree of a node contains only values lesser, than the node's value;
 right subtree of a node contains only values greater, than the node's value.
Notice, that definition above doesn't allow duplicates.
Example of a binary search tree
Binary search tree. Internal representation

Like any other dynamic data structure, BST requires storing of some additional auxiliary data, in
order to keep its structure. Each node of binary tree contains the following information:
 a value (user's data);

 a link to the left child (auxiliary data);
 a link to the right child (auxiliary data).
Depending on the size of user data, memory overhead may vary, but in general it is quite
reasonable. In some implementations, node may store a link to the parent, but it depends on
algorithm, programmer want to apply to BST. For basic operations, like addition, removal and
search a link to the parent is not necessary. It is needed in order to implement iterators.
With a view to internal representation, the sample from the overview changes:
Leaf nodes have links to the children, but they don't have children. In a programming language it

means, that corresponding links are set to NULL.
Tree Traversal:
A traversal is a process that visits all the nodes in the tree. Since a tree is a nonlinear data
structure, there is no unique traversal. We will consider several traversal algorithms with we
group in the following two kinds
 depth-first traversal
 breadth-first traversal
There are three different types of depth-first traversals, :
 PreOrder traversal - visit the parent first and then left and right children;
 InOrder traversal - visit the left child, then the parent and the right child;
 PostOrder traversal - visit left child, then the right child and then the parent;
There is only one kind of breadth-first traversal--the level order traversal. This traversal visits
nodes by levels from top to bottom and from left to right.
As an example consider the following tree and its four traversals:
PreOrder - 8, 5, 9, 7, 1, 12, 2, 4, 11, 3

InOrder - 9, 5, 1, 7, 2, 12, 8, 4, 3, 11
PostOrder - 9, 1, 2, 12, 7, 5, 3, 11, 4, 8
LevelOrder - 8, 5, 4, 9, 7, 11, 1, 12, 3, 2

Excerises
Write a program to create a Tree for the following diagram.

1
Insert Sequence of data: 52, 25, 60, 35, 20, 59, 65
Write a program to print the nodes of the following Tree diagram through Pre-Order,
2
In-Order and Post-Order
52
60
25
20 35 59 65


Lab 11: Implementation of The BINARY SEARCH TREE Data Structure With The Help of Algorithms

Uploaded by

Document Informationclick to expand document information

Copyright:

Available Formats

Lab 11: Implementation of The BINARY SEARCH TREE Data Structure With The Help of Algorithms

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lab 11: Implementation of The BINARY SEARCH TREE Data Structure With The Help of Algorithms

Uploaded by

Copyright:

Available Formats

CSC-221: Data Structures &

Lab 11: Implementation of the BINARY SEARCH TREE data structure

Binary Search Tree

Example of a binary search tree

Binary search tree. Internal representation

 a value (user's data);

Department of Computer Sciences 2/4 Semester BSCS 3

PreOrder - 8, 5, 9, 7, 1, 12, 2, 4, 11, 3

LevelOrder - 8, 5, 4, 9, 7, 11, 1, 12, 3, 2

Department of Computer Sciences 3/4 Semester BSCS 3

Write a program to create a Tree for the following diagram.

Department of Computer Sciences 4/4 Semester BSCS 3

You might also like