DIY: Populating Next Right Pointers in Each Node
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.
By signing up, you agree to Educative's Terms of Service and Privacy Policy