14. Design a conventional iterative algorithm to traverse a binary tree 17.

17. Design a conventional algorithm to traverse a binary tree represented 0. Design a conventional iterative algorithm to traverse a binary tree
represented in one dimensional array in inorder in two dimensional array in inorder. represented in linked lists in inorder.
Ans. In-order traversal :- Ans. In-order traversal:- Ans. In-order traversal :-
Algorithm : Inorder Traversal Algorithm : InOrder Traversal Algorithm : InOrder Traversal
Input : A[ ], one dimensional array Input : A[ ], two dimensional Input : bt, address of the root
representing the binary tree, array representing the binary tree, node
‘i’, the root address ‘i’, ‘j’, the two root address Output : InOrder Sequence
//initially i=1 //initially i=j=1 Method : If (bt != NULL)
Output : Inorder Sequence Output : InOrder Sequence {
Method : If (A[i] != 0) Method : If (A[i, j] != 0)
Inorder Traversal ([bt].LChild)
Inorder Traversal (A, 2i) Inorder Traversal (A, 2i, 2j)
Display ([bt].data)
Display (A[i]) Display (A[i, j])
Inorder Traversal ([bt].RChild)
Inorder Traversal (A, 2i + 1) Inorder Traversal (A, 2i + 1, 2j + 1) }
If endAlgorithm ends. If endAlgorithm ends. If endAlgorithm ends.
15. Design a conventional iterative algorithm to traverse a binary tree 18. Design a conventional iterative algorithm to traverse a binary tree 21. Design a conventional iterative algorithm to traverse a binary tree
represented in one dimensional array in preorder. represented in two dimensional array in preorder. represented in linked lists in preorder.
Ans. Pre-Order traversal:- Ans. Pre-order traversal:- Ans. Pre-order traversal :-
Algorithm : PreOrder Traversal Algorithm : PreOrder Traversal Algorithm : PreOrder Traversal
Input : A[ ], one dimensional Input : A[ ], two dimensional Input : bt, address of the root
array representing the binary tree, array representing the binary tree, node
‘i’, the root address // ‘i’, ‘j’, the two root address Output : PreOrder Sequence
initially i=1 //initially i=j=1 Method : If (bt != NULL)
Output : PreOrder Sequence Output : PreOrder Sequence {
Method : If (A[i] != 0) Method : If (A[i, j] != 0)
Display ([bt].data)
Display (A[i]) Display (A[i, j])
Preorder Traversal ([bt].LChild)
PreOrder Traversal (A, 2i) Preorder Traversal (A, 2i, 2j)
Preorder Traversal ([bt].RChild)
PreOrder Traversal (A, 2i + 1) Preorder Traversal (A, 2i + 1, 2j + 1) }
If endAlgorithm ends. If endAlgorithm ends. If endAlgorithm ends.
16. Design a conventional iterative algorithm to traverse a binary tree 19. Design a conventional iterative algorithm to traverse a binary tree 23. Design a conventional iterative algorithm to traverse a binary tree
represented in one dimensional array in postorder. represented in two dimensional array in postorder. represented in linked lists in postorder.
Ans. Post-order traversal :- Ans. Post-order traversal:- Ans. Post-order traversal :-
Algorithm : PostOrder Traversal Algorithm : PostOrder Traversal
Algorithm : PostOrder Traversal Algorithms Input : bt, address of the root
Input : A[ ], one dimensional Input : A[ ], two dimensional node
array representing the binary tree, array representing the binary tree, Output : PostOrder Sequence
‘i’, the root address ‘i’, ‘j’, the two root address Method : If (bt != NULL)
//initially i=1 //initially i=j=1 {
Output : PostOrder Sequence Output : PostOrder Sequence Algorithms
Method : If (A[i] != 0) Method : If (A[i, j] != 0) Postorder Traversal ([bt].LChild)
Algorithms
Postorder Traversal (A, 2i, 2j) Postorder Traversal ([bt].RChild)

postorder Traversal (A, 2i) Postorder Traversal (A, 2i + 1, 2j + 1) Display ([bt].data)

}
postorder Traversal (A, 2i + 1) Display (A[i, j]) If end Algorithm ends.
If endAlgorithm ends.
Display (A[i])
If endAlgorithm ends.