Pergunta de entrevista da empresa Arista Networks

find the min value in BST

Respostas da entrevista

Sigiloso

12 de out. de 2012

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

1

Sigiloso

25 de jan. de 2013

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)); }

Sigiloso

12 de mar. de 2015

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); }

Sigiloso

23 de abr. de 2012

Leftmost node is the one with the min value.