CSE-2050

Term Paper Synopsis

Topic- Representation of traversing techniques Binary trees in memory

Submitted To: Mr. Munish Kumar Mittal

Submitted By: Gaurav Sharma (RB6803A24) Nitish Kumar (RB6803A23)

Introduction to the topic:

The topic of the term paper is Representation of traversing techniques Binary trees in memory. As the name suggests, it is based on the traversal of data in a Binary Tree. A binary tree in a data structure is a type of structure where a parent node has at least two child nodes. Child nodes should always refer to their parent nodes. A typical example of a binary tree would be as given:

It is clearly visible that each node points to two child nodes, till the terminating nodes. The child nodes are often referred to as the RIGHT and LEFT nodes, as per they are visible to us.

Traversing Techniques:
These are the following techniques of the binary tree traversing: 1. Inorder (Left,Root,Right) 2. Preorder (Root,Left,Right) 3. Postorder (Left,Right, Root) 4. Reverse PreOrder(Right, Left, Root) 5. Reverse InOrder(Right,Root,Left) 6. Reverse PostOrder (Root, Right, Left) 7. Breadth-first Traversal

About the term paper compilation:

This term paper is a joint project being shared by two persons, Nitish Kumar (RB6803A23) and Gaurav Sharma (RB6803A24). We will be working on the various modules differently, and them compile up things together. The different modules that we are working are as: 1. Introduction to topic 2. Description of the binary tree 3. Traversal techniques (7 techniques) 4. Description of each technique 5. Some practical examples of each technique 6. Benefits and applications of each technique 7. Future prospective

Here the point number 1,2 will be done by roll number 23 alone. 3 of the given 7 techniques will also be done solely by him. Roll no 24 will do the rest 4 techniques, as well as point no 7. The review, omissions, editing and final compiling will be done by both the persons jointly. The C++ language would be used in doing all sorts of programming and execution.