Pre Order Traversal In Binary Tree

-

Pre Order Traversal In Binary Tree

  1. Its NLR ordered traversal.
  2. The order goes this way:
    1. N: visit the node
    2. L: Traverse the left sub tree.
    3. R: Traverse the right sub tree.
  3. Lets check with an example. Consider the following example.


      • Visit the node 1
      • Traverse the left sub tree of node 1
        • Visit the node 2
        • Traverse the left sub tree of node 2
          • Visit the node 4
        • Traverse the right sub tree of node 2
          • Visit the node 5
      • Traverse the right sub tree of node 1
        • Visit the node 3
        • Traverse the left subtree of node 3
          • Visit the node 6
        • Traverse the right sub tree of node 3
          • Visit the node 7
    2. On completing the traversal we get the pre order if we follow the bolded nodes.
    3. Pre Order: 1 , 2 , 4 , 5 , 3 , 6 , 7

Comments

Post a Comment

Popular

Traversal In A Binary Tree - Tree -3

-
Image
Traversal In Binary Tree Traversing a binary tree means visiting each node of the tree exactly once. At each node : N : Visit the node L : Traverse its left subtree R : Traverse its right subtree These actions can be performed in any order... (3! = 6 different ways of ordering the three tasks.) Different orders: NRL NLR LNR LRN RNL RLN But we follow the convention which states left subtree to be traversed before right sub tree. Thus we are left with three orders: NLR , LNR and LRN The orders are named according the position of the node i.e., position of N in the order. pre : NLR in  : LNR post : LRN PRE ORDER TRAVERSAL: ( NLR ) N : Visit the node L : Traverse the left subtree R : Traverse the right subtree IN ORDER TRAVERSAL: ( LNR ) L : Traverse the left subtree N : Visit the node R : Traverse the right subtree ...
Read more

Tree data structure - 2

-
Image
Trees - 2 Types: Strictly binary tree: Degree is every node either 0 or 2. Full Binary tree: Degree of every node is 2. Complete Binary Tree:A binary tree in which every level , exccept possibly the last , is completely filled and all nodes are as far left as possible. Array Representation of binary tree: Also called as sequential representation or linear representation We use 1D array Store the data with indexed 1 i.e., root node at Array[1](Even we can use 0 based index ) If a node is at index k in the array, its left child is at index 2k and right child at index 2k+1. If a node at index k then its parent is at index floor(k/2) The size of array needed to store a tree of height h is 2 h -1 Linked list representation : struct node { struct node *left; struct node *right; int data; } This structure can be used for the binary tree. Self referential structure where first and second...
Read more