We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Trees
  4. Tree: Preorder Traversal
  5. Discussions

Tree: Preorder Traversal

  • im_priyank_jain
     + 12 comments

    Morris Traversal without using Recursion & Stack

    Node pre;
    if(root == null)
        return;
    Node curr = root;
    while(curr != null){
        if(curr.left == null){
            System.out.print(curr.data+" ");
            curr = curr.right;
        }else{
             pre = curr.left;
             while(pre.right !=null && pre.right != curr)
                 pre = pre.right;
             if(pre.right == null){
                 pre.right = curr;
                 System.out.print(curr.data+" ");
                 curr = curr.left;
             }else{
                 pre.right=null;
                 curr=curr.right;
             }
        }
    }