How Will You Find The Minimum Element In A Binary Search Tree #564

 public void min(Tree root) { while(root.left() != null) { root = root.left(); } System.out.println(root.data()); }

 public void min(Tree root) { while(root != null) { root = root.left(); } System.out.println(root.data()); }

 public void min(Tree root) { while(root.right() != null) { root = root.right(); } System.out.println(root.data()); }

 public void min(Tree root) { while(root != null) { root = root.right(); } System.out.println(root.data()); }