Option 2: Sorting a Binary Tree Option 2 is to sort a binary tree. Binary trees can help to speed up algorithms that use decision branches, but binary trees are only fast if they are sorted. The convention in a binary tree is left node right node The following unsorted binary tree would need a few nodes to be swapped: 840 11 82 35 This would make it a sorted binary tree 840 35 82