<<< Searching Traversals

1. Properties of Searching Traversals: e.g. 

1. Depth First Search

2. Depth First Traversals: e.g.  

1. Inorder (Left, Root, Right) e.g.  4  2  5  1  3 

2. Preorder (Root, Left, Right) e.g.  1  2  4  5  3

3. Postorder ( Left, Right, Root) e.g.  4  5  2  3  1

3. Breadth First or Level Order Traversal: e.g.  1  2  3  4  5

Note: Notation: e.g.  Infix Notation, Prefix (Polish) Notation, Postfix (Reverse-Polish) Notation

#Programming #Algorithm #CodeAnalysis #SearchingTraversals #AbdurRahimRatulAliKhan

>>>