LeetCode 116. Populating Next Right Pointers in Each Node [Algorithm + Code Explained ]

Publié le: 24 mars 2020
sur la chaîne: jayati tiwari

8,425

158

One of the most frequently asked coding interview questions on Dynamic Programing on Tree in companies like Google, Facebook, Amazon, LinkedIn, Microsoft, Uber, Apple, Adobe etc.

LeetCode : Populating Next Right Pointers in Each Node

Question : You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:

struct Node {
int val;
Node *left;
Node *right;
Node *next;
}
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.

Initially, all next pointers are set to NULL.

Example:

Input: root = [1,2,3,4,5,6,7]
Output: [1,#,2,3,#,4,5,6,7,#]

Explanation: Given the above perfect binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B. The serialized output is in level order as connected by the next pointers, with '#' signifying the end of each level.

Connect with me on LinkedIn at: / jayati-tiwari

Sur cette page du site, vous pouvez voir la vidéo en ligne LeetCode 116. Populating Next Right Pointers in Each Node [Algorithm + Code Explained ] durée heure minute seconde en bonne qualité , qui a été Téléchargé par l'utilisateur jayati tiwari 24 mars 2020, Partagez le lien avec vos amis et connaissances, sur youtube cette vidéo a déjà été regardée 8,425 fois et il a aimé 158 téléspectateurs. Bon visionnage!