Representation of binary tree in memory

-

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 Representation of 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 RIGHTpointer 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:
node representations
In 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.
Binary Tree
Binary tree node representations
Linked Representation of the Binary Tree
Linked Representation of Binary Tree

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:
Sequential Representation of Binary Tree
Its sequential representation is as follow:
Sequential Representation of Binary Tree 1

Thank you viewers ...
This is published by soumy Sinha..
If u like then pls subscribe and share with your friends..

Comments

Post a Comment

Popular posts from this blog

Introduction of Digital computer

-
Image
INTRODUCTION Digital computer concept:- 1. Digital computers are designed to store, process and communicate information in digital form. 2. Digital computer is any of a class of digital devices capable of solving problems by processing information in discrete form. 3. It is used for processing data represented by discrete, localized physica signals, as the presence or electic current. 4.The main three components of digital computer:- >input:- The user gives a set of input data through input devices. >Processing :- The input data is processed with the help of CPU by well defined and finite sequence of step. >Output : - Some data available from the processing step are output to the user. TYPE OF DIGITAL COMPUTER :- 1.Microcomputer/Desktop computer 2.Minicomputer 3.Mainframe computer 4.Supercomputers Microcomputer :- 1.Microcomputer is also called a personal computer or desktop computer. 2.It includes a microprocessor, memory,...
Read more

INTRODUCTION OF DBMS

-
What is Database :- The database is a collection of inter-related data which is used to retrieve, insert and delete the data efficiently. It is also used to organize the data in the form of a table, schema, views, and reports, etc. For example: The college Database organizes the data about the admin, staff, students and faculty etc. Using the database, you can easily retrieve, insert, and delete the information. DBMS (Database Management System):- Database management system is a software which is used to manage the database. For example: MySQL, Oracle, etc are a very popular commercial database which is used in different applications.DBMS provides an interface to perform various operations like database creation, storing data in it, updating data, creating a table in the database and a lot more.It provides protection and security to the database. In the case of multiple users, it also maintains data consistency. DBMS allows users the following tasks:- Data Definitio...
Read more

Introduction to cache memory

-
Image
Cache Memory in Computer Organization Cache Memory  is a special very high-speed memory. It is used to speed up and synchronizing with high-speed CPU. Cache memory is costlier than main memory or disk memory but economical than CPU registers. Cache memory is an extremely fast memory type that acts as a buffer between RAM and the CPU. It holds frequently requested data and instructions so that they are immediately available to the CPU when needed. Cache memory is used to reduce the average time to access data from the Main memory. The cache is a smaller and faster memory which stores copies of the data from frequently used main memory locations. There are various different independent caches in a CPU, which stored instruction and data. Levels of memory: Level 1 or Register – It is a type of memory in which data is stored and accepted that are immediately stored in CPU. Most commonly used register is accumulator, Program counter, address register etc. Level 2 or...
Read more