**Binary tree traversal methods**

1. Breath first traversal

2. Depth first traversal

**Breath first traversal**

It is called level order traversing. It traverse the node in each level then goto the children.

**Depth first traversal**

Inorder traversal (Left -- Root --- Right)

Preorder traversal (Root -- Left -- Right)

Postorder traversal (Left -- Right-- Root)

Lets assume A is left node, + is root node & B is right node then following will be easier way to remember

A+B = Inorder

AB+ = Post Order

+AB = Pre order