Question

Write pseudocode for one of the classic traversal algorithms (preorder, inorder, and postorder) for binary trees.

Assuming that your algorithm is recursive, find the number of recursive calls made

Answer 1

Comment down for any queries
Please give a thumbs up if you are satisfied with the answer

Pseudocode Inorder (tree)

1) Traverse the left subtree for example call Inorder for left-subtree

2)Visit the root

3)Traverse the right subtree for example call Inorder->right subtree.

if( P!=Null)

call display Inorder(p->left) // this recursive function will be called again and it will first traverse all left //subtree. Then it will out left value and then root value in then right

//(left, Root<right)

count<< p-> value

call display Inorder(p->right)

// C++ code

void IntBinaryTree::displayInOrder(TreeNode* p)
{
   if (p != NULL)
   {
       displayInOrder(p->left);
       cout << p->value << " ";
       displayInOrder(p->right);
   }
}

Comment down for any queries
Please give a thumbs up if you are satisfied with the answer