Question d’entretien chez Bloomberg
The first question is given binary tree. populate the next node for each tree node. the node has {val, left, right, next} properties. similar to Populating Next Right Pointers in Each Node II in leetcode.
Réponse à la question d'entretien
Utilisateur anonyme
11 févr. 2018
I used both queue solution O(n) solution and in-place solution