Caption reads, "Figure 5.6: Both of these graphs are trees, but the tree on the left is not a binary search tree because
5 is to the left of 4. Swapping 5 and 3 in the graph on the left would result in a BST." However, this is not true, because 2 is still a right child of 3 even if 5 and 3 are swapped.
Caption reads, "Figure 5.6: Both of these graphs are trees, but the tree on the left is not a binary search tree because 5 is to the left of 4. Swapping 5 and 3 in the graph on the left would result in a BST." However, this is not true, because 2 is still a right child of 3 even if 5 and 3 are swapped.