Consider the Binary Search Tree with nodes 3, 23, 56, 57, 66, 72 (56 is root; left child 23 with left child 3; right child 66 with left child 57 and right child 72). If node 66 is removed (replacing it with its in-order successor), what is the resulting preorder traversal sequence?