Tree Traversal

 

Tree Traversal

Handwritten Notes- Click Here

A tree is a non-linear data structure in which elements are arranged in a hierarchical structure.

Tree Traversal is the process of visiting each node of a tree exactly once in a particular order.

The main types of tree traversal are:

  1. Preorder Traversal (Root → Left → Right)
  2. Inorder Traversal (Left → Root → Right)
  3. Postorder Traversal (Left → Right → Root)
Preorder Traversal :

In Preorder Traversal, the root node is visited first, followed by the left subtree and then the right subtree.

Example

        A
       / \
      B   C
     / \
    D   E

The Preorder Traversal is: A → B → D → E → C


Inorder Traversal:

In Inorder Traversal, the left subtree is visited first, followed by the root node and then the right subtree.

Example

        A
       / \
      B   C
     / \
    D   E

The Inorder Traversal is: D → B → E → A → C


Postorder Traversal:

In Postorder Traversal, the left subtree is visited first, followed by the right subtree, and the root node is visited last.

Example

        A
       / \
      B   C
     / \
    D   E

The Postorder Traversal is: D → E → B → C → A







Comments

Post a Comment

Popular posts from this blog

Entity-Relationship(ER) Model

Image
Entity-Relationship(ER) Model Handwritten Notes - Click Here The Entity-Relationship (ER) Model is a conceptual data model. It helps database designers understand the requirements of a system before creating the actual database tables . It describes the important objects in a system, their properties , and the relationships between them. The three basic concepts of the ER model are Entity Attribute Relationship Entity An entity can be any real-world object, person, place, or class about which we want to store information in a database. In a traditional ER diagram, an entity is represented by a rectangle .                        Example: Employee and Department An employee works for a department. Here, Employee and Department are entities , and Works For is the relationship between them. Weak Entity A weak entity is an entity that depends on another entity for its identification of existence. A weak entity is represen...
Read more

Queue ADT

Image
  Queue ADT Handwritten Notes- Click Here A  Queue  is a linear data structure in which elements are inserted at one end and removed from the other end.( Insertion → Rear,  Deletion → Front )                                   ↓ FRONT                                 ↓ REAR A B C D E    A queue follows the FIFO (First In, First Out) principle. This means that the element inserted first is removed first. A  Queue can be implemented using: Array Linked List Basic  Queue  Operations: 1. Enqueue - used to insert  a new element into the queue. 2. Dequeue - used to remove an element from the queue. 3. Peek - used to view the first element without removing it. 4. isEmpty - checks whether the queue contains any elements. 5...
Read more

Normalization in DBMS,(1NF,2NF,3NF,BCNF,4NF,5NF)

Image
                      Normalization in DBMS Handwritten Notes - Click Here Normalization divides a large table into smaller , logically related tables and connects them using appropriate keys. The main purpose of normalization is to reduce unnecessary duplication of data and prevent problems that may occur when data is inserted, updated, or deleted. 1. First Normal Form (1NF) A relation is said to be in First Normal Form (1NF) when every attribute contains a single, indivisible value . Conditions of   1 NF Each cell must contain only one value. Multiple values should not be stored in the same field. ·         Example Customer Items Purchased Gowsi Rice, Dal Tamil Soap ·   Here, the Items Purchased column contains more than one value for Gowsi . ·   Therefore, the table is not in 1 NF . ...
Read more