Insert 13: a. Create a new node with b. b. Starting at the root node (2), compare the value of the new node (13) to the value of the C. current node (2). c. Since 13 is greater than 2, move to the right child (5). d. d. Since 13 is greater than 5, move to the right child (9). e. f. e. Since 13 is greater than 9, move to the right child (12). f. Since 13 is greater than 12, move to the right child. g. g. Insert 13 as the right child of 12.