Operations on binary treesTraversals

• pre-order traversal

  • visit the root
  • traverse the left sub-tree in pre-order
  • traverse the right sub-tree in pre-order

• In-order traversal

  • traverse the left sub-tree in in-order
  • visit the root
  • traverse the right sub-tree in in-order

• Post-order traversal

  • traverse the left sub-tree in post-order
  • traverse the right sub-tree in post-order
  • visit the root

Previous slide

Next slide

Back to first slide

View graphic version