Question 46 1 pts To find the minimum node in a non-empty binary search tree you should start at the root, and then keep passing from each node to its right child until you come to a node with no right child you should start at the root, and then keep passing from each node to its left child until you come to a node with no left child you need to examine every node, and then pick the one with the least value you should look at the root of the binary tree Next