Example Binary Tree Traversals - Preorder, Inorder, Postorder, & Level Order

This video walks through four different traversals of the same binary tree. 0:23 - Preorder traversal 1:13 - Inorder traversal 2:09 - Postorder traversal 3:28 - A way to check your answer based on where the root of each subtree is 4:03 - Level order traversal 4:32 - A discussion of ordering of elements in the traversal. For general binary trees, there is no guarantee that any traversal will return the elements in order. Only binary search trees (BSTs) guarantee an order, returning the elements in order when you do an in order traversal.