algo_045.md (285B)
1 # algo_045 2 3 ### Problem Statement 4 5 > Write a recursive algorithm for inorder traversal of a binary tree. 6 7 ## Algorithm 8 ``` 9 procedure inorder(ptr) 10 begin 11 if (ptr ≠ NULL) then 12 inorder(LC(ptr)); 13 write(INFO(ptr)); 14 inorder(RC(ptr)); 15 endif 16 end procedure 17 ```