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.

Question

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.

Anonym · Accepted Answer

I used both queue solution O(n) solution and in-place solution

Bloomberg

Frage im Vorstellungsgespräch bei Bloomberg

Antwort im Vorstellungsgespräch

Beobachtete Unternehmen

Jobsuchen