Domanda di colloquio di Arista Networks

2. In Order Tree Traversal.

Risposta di colloquio

Anonimo

7 mar 2022

this is the right answer: strcut node* node=current; next_node(node.left); return next; next_node(node.right); I was putting an if statement to check if the value is null, but that was not needed, I removed that check but still he left.