Skip to main content

Tree Traversal

   
    ⇰   TREE TRAVERSAL :-
Tree Traversal refers to the process of visiting each node in a tree data structure exactly once. You might for instance want to add all the values in the tree or find the largest one. For all these operations, you will need to visit each node of the tree atleast and exectly once. Linear data structures like arrays, stacks, queues and linked list have only one logical way to read the data. But a hierarchical data structure like a tree can be traversed in different ways. Following are the generally used Techniques for traversing trees :-   i>Breadth First Traverse.
 ii> Depth First Traverse.



i > Breadth First Traverse :- Breadth First Traverse of a tree is technique of printing all the nodes of a tree level by level. It is also called as Level Order Traversal.
 Tufan Görel: Generic Iterative Breadth-First Binary Tree Traversal ...
Here if we traverse in above tree by breadth first treverse technique the traversal will be on level wise as in the order :- 1 2 3 4 5 6.


 ii > Depth First Traverse :- Depth-first traverse is a method of tree traversal . In Depth First traverse we go as deep as possible down one path before backing up and trying a different one.
Following three traversal techniques fall under Depth First Traversal :-
∗ Preorder Traversal.
∗ Inorder Traversal.∗ Postorder Traversal.
Algorithm :-
 Binary Tree - Preorder Traversal - Non Recursive Approach | Algorithms
2. Visit the root.
2.Traverse the right sub tree.
 Binary Tree-Postorder Traversal - Non Recursive Approach | Algorithms


∗ Preorder Traversal :- In this technique first of all we process the root of the binary tree. Then we traverse the left sub tree in pre order. After complition of left sub tree , then we take over right sub tree and procee all the nodes in pre order.
1.Visit the root.
2.Traverse the left sub tree.
3.Traverse the right sub tree.                 
          Root → Left → Right


∗ Inorder Traversal :- In this technique first of all we process the left subtree in inorder. Then process the root and at the last we process the rioght sub tree in inorder
Algorithm :-
1. Traverse the left sub tree.
3. Traverse the right sub tree.

       Left → Root → Right
 Inorder predecessor in binary search tree | Algorithms and Me

Here if we traverse in above tree by Inorder treverse technique the traversal will be as in the order :- 1 5 6 7 10 12 14 16.



∗ Postorder Traversal :- In this technique first of all we process the left subtree in inorder. Then process right subtree  in postorder and at the last treverse to root.
Algorithm :-
1.Traverse the left sub tree.
3.Visit the root.
     
        Left → Right → Root
More Example :-
Operations on Binary Search Tree's


FOR BASIC CONCEPT OF TREE DATA STRUCTURE GO THROUGH THIS LINK :- https://priypurnea.blogspot.com/2020/04/basic-concept-of-trees-and-its-type-in.html

FOR TYPE OF BINARY TREE STRUCTURE GO THROUGH THIS LINK :- https://priypurnea.blogspot.com/2020/04/types-of-binary-tree.html

 Share, Follow and please comment if you find anything incorrect, or to share more information about the topic discussed above.




Labels:

Comments

Post a Comment

Please comment.

Popular posts from this blog

Process Scheduling And Types of Process Schedular :-

        ⇰ PROCESS SCHEDULING Process Scheduling  is a task  of Operating System that schedules processes of different states like new, ready, waiting, terminated  and running.This scheduling helps in allocation of CPU time for each process, and Operating System allocates the CPU time for each procss. And the process scheduling plays important role to keep the CPU busy all the time.  ⏩   Followings are some objectives of Process Scheduling :-  i > To increase the amount of users within acceptable response times.  ii > To maintain the balance between response and utilization of system. iii > To decrease the enforce priorities and  give reference to the processes holding the key resources.      ⇰  PROCESS SCHEDULAR A scheduler carries out the pro cess scheduling work. Schedulers are often implemented so they keep all computer resources busy and  allows multiple users to share system resources  to achieve  multiprogramming .  There are  mainy three types of pro
8 comments
Read more

Process & Its state And process control block :-

                ⇰  PROCESS :- A process can be thought of as a program in execution. Means when any program is executed it becomes process. A processwill need certain resources such as CPU time , memory, files and I/O devices to complete its task. These resources are allocated to the process either when it is created or at the time of execution.             A process is the unit of work in most systems. A system consistes of a collection of processes. All these processes may execute concurrently. Traditionally a process contained only a single thread. Most modern operating ststems now supports processes that have multiple threads.         The operating system is responsible for several important works of process management as - the creation and deletion of process, the schrduling of process, communication and deadlock handling of process. Process is broudly divided into two types:-  i> System  Process. ii> User Process. Early computers allowed only one program be ex
Post a Comment
Read more

Semaphores In Process Synchronization

   ⇰  Semaphores :-   Semaphore is actually a method or tool to prevent race condition. Race condition can cause loss of data or even deadlock situation. For prevention from these conditions, the semaphore is one of the method.  Semaphore was proposed by Dijkstra in 1965. Simaphore    is a very significant technique to manage concurrent processes.  Semaphore is useful tool in the prevention of race condition. But the use of semaphore never means a guarantee that a program is free from these problems.     Semaphore is an integer variable which is used in mutual exclusive manner by various concurrent cooperative processes in order to acheive synchronization. Hence semaphore is one of the way to achieve synchronization.  Semaphore is basically  a variable which is non-negative and shared between threads. This variable is used to solve the critical section problem and to achieve process synchronization in the multiprocessing environment. Semaphore contains some operations as f
Post a Comment
Read more