Inorder(p)
{ If p = nil return;
Inorder(p.left)
process(p.data)
Inorder(p.right) }
Chat with our AI personalities
In order traversal is used.
1. pre-order b-tree traversal. 2. in-order b-tree traversal. 3. post-order b-tree traversal
Here is the algorithm of the algorithm to write an algorithm to access a pointer in a variable. Algorithmically.name_of_the_structure dot name_of_the _field,eg:mystruct.pointerfield
a write the algorithm to concatenate two given string
Step 1:- select first root node (t), start travelsing left contin