Give depth first search of the given binary tree?
The order in which the nodes would be visited is
A B D E C F H I J K G
Traverse the tree given below in preorder, in order, post order and level by level giving a list of nodes visited.
Postorder: EA+B-CD + *-
Level by level: *- + +BCDEA