DIY: Populating Next Right Pointers in Each Node
We'll cover the following
Problem statement
You are given a perfect binary tree where all the leaves are on the same level and every parent has two children. We have added an additional next pointer to our TreeNode implementation. ...
Create a free account to view this lesson.
Continue your learning journey with a 14-day free trial.
By signing up, you agree to Devpath's Terms of Service and Privacy Policy