find the min value in BST

Question

Fujimaru · Accepted Answer

node_t *min(node_t *node)
{
  if (node == NULL)
    return NULL;
  if (node->left == NULL)
    return node;
  min(node->left);
}

nkarkhan · Answer

tree_element_t *tree_get_min (tree_element_t *elem)
{
    if (NULL == elem) return elem;
    if (NULL == elem->left) return elem;
    return (tree_get_min(elem->left));
}

universini · Answer

int find_min (btree *node)
{
    if (node == NULL)
        return (-1);

    while (node->left != NULL)
        node = node->left;

    return (node->data);
}

int find_max (btree *node)
{
    if (node == NULL)
        return (-1);

    if (node->right != NULL)
        node = node->right;

    return (node->data);
}

Anonymous · Answer

Leftmost node is the one with the min value.

Arista Networks

Arista Networks Interview Question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches