Scribd
Upload
57 views

Binary Tree-Wps Office

The document discusses binary trees, including their definition, memory representation, traversing methods, and applications. A binary tree is a non-linear data structure where each node has at most two children. There are two common ways to represent a binary tree in memory: sequentially using an array or linked using pointers. Traversing a binary tree involves recursively visiting nodes using inorder, preorder, or postorder methods. Binary trees are useful for searching large datasets and are often used to build binary search trees for database indexing.

Uploaded by

Nisha Nishad
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
57 views

Binary Tree-Wps Office

The document discusses binary trees, including their definition, memory representation, traversing methods, and applications. A binary tree is a non-linear data structure where each node has at most two children. There are two common ways to represent a binary tree in memory: sequentially using an array or linked using pointers. Traversing a binary tree involves recursively visiting nodes using inorder, preorder, or postorder methods. Binary trees are useful for searching large datasets and are often used to build binary search trees for database indexing.

Uploaded by

Nisha Nishad
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

BINARY

TREE
Definition 1
Index Type of tree
2
Memory Representation 23
Traversing of tree
4
Application of tree
5
 Definition:-
•A binary tree is a non-linear linked list where each node may point
to two other nodes.
 Every node in a binary tree can
have at most two children.
 The two children of each node are
called the left child and right child
corresponding to their positions.
 A node can have only a left child or
only a right child or it can have no
children at all.
 Left child is always less that its
parent, while right child is greater
than its parent.
•A node that has no children is
called a leaf node.
•All pointers that do not point to a node
are set to NULL.
BINARY TREE
 Binary trees can be divided into subtrees. A subtree is an entire
branch of the tree, from one particular node down.

6
 Types of Binary Tree
Following are common types of Binary Trees.

Full Binary Tree A Binary Tree is full if every node has 0 or 2


children. Following are examples of a full binary tree. We can also say
a full binary tree is a binary tree in which all nodes except leaves
have two children.
 Complete Binary Tree: A Binary Tree is complete Binary Tree if all levels are
completely filled except possibly the last level and the last level has all keys as
left as possible
 Following are examples of Complete Binary Trees
 Perfect Binary Tree A Binary tree is Perfect Binary Tree in which all
internal nodes have two children and all leaves are at the same level.

Following are examples of Perfect Binary Trees.


 REPRESENTING BINARY
TREE IN MEMORY
Let T be a Binary Tree. There are two ways of representing T in the
memory as follow
1. Sequential Representation of Binary Tree.
2. Link Representation of Binary Tree.
1) Linked Representationof Binary Tree
Consider a Binary Tree T. T will be maintained in memory by means of a linked list
representation which uses three parallel arrays; INFO, LEFT, and RIGHT pointer variable
ROOT as follows. In Binary Tree each node N of T will correspond to a location k such that
1. LEFT [k] contains the location of the left child of node N.
2. INFO [k] contains the data at the node N.
3. RIGHT [k] contains the location of right child of node N.

Representation of a node:

n this representation of binary tree root will contain the location of the root R
of T. If any one of the subtree is empty, then the corresponding pointer will
contain the null value if the tree T itself is empty, the ROOT will contain the
null value.
Example:-
Consider the binary tree T in the figure. A schematic diagram of the linked
list representation of T appears in the following figure. Observe that each
node is pictured with its three fields, and that the empty subtree is pictured
by using x for null entries.
2)Sequential representation of
Binary Tree
Let us consider that we have a tree T. let our tree T is a binary tree
that us complete binary tree. Then there is an efficient way of
representing T in the memory called the sequential representation or
array representation of T. This representation uses only a linear
array TREE as follows:

1. The root N of T is stored in TREE [1].


2. If a node occupies TREE [k] then its left child is stored in TREE
[2 * k] and its right child is stored into TREE [2 * k + 1].
For Example:
Consider the following Tree: Its sequential representation is as
follow:
 Traversing the Tree
01 There are three common
methods for traversing a binary
tree and processing the value of
each node:
•inorder
•preorder
•postorder
02 Each of these methods is best
implemented as a recursive
function.
1. The node’s left subtree is traversed.
2. The node’s data is processed.
3. The node’s right subtree is traversed.

16
1. The node’s data is processed.
2. The node’s left subtree is traversed.
3. The node’s right subtree is traversed.

17
1. The node’s left subtree is traversed.
2. The node’s right subtree is traversed.
3. The node’s data is processed.

18
 Applications of Binary Trees
•Binary trees are excellent data structures for searching large
amounts of information. They are commonly used in database
applications to organize key values that index database records.
•When used to facilitate searches, a binary tree is called a binary
search tree.
THANK
YOUS

You might also like