11. Level Order Successor | BFS Pattern | Binary Tree Tutorials | Code Implementation

#tree #datastructures #interview

Hello viewers!

In this video, we have discussed the Level Order Successor of a Binary Tree using BFS technique.
----------------------------------------------------
----------------------------------------------------
----------------------------------------------------
----------------------------------------------------

Please consider subscribing to the channel.

Extra video covers:

Tree Data Structures
Binary Tree Data Structures
Video Series on Tree
Best Tree Videos
Beginner to Advanced
Binary Tree Tutorials
Tree Tutorials
Preorder Traversal
Inorder Traversal
Postorder Traversal

[pushkarchaubey]

tree itna aasani se smjh me aa jaye ga pata nahi tha, thanku sir

[samriddhimishra]

All the variant of tree data structure till now are amazing... All the problems are brain storming and Thanku sir for ur efforts and at last I must say maja aa gya boss🔥🔥🔥 😇😇😇

[dsaaz]

Great Sir. Your teaching style is best.

[ashutoshtiwari]

thankyou sir for providing me very easy and clear tree concept and specially bfs and by watching your videos i will eagerly want more to connect with data structure

[surabhsaxena]

to be honest, bfs pattern never looked so easy before..🔥🔥🔥🔥

[dsaaz]

Sir after tree and graph can we get series on Number Theory.

[PythonGuruji]

No one cares that you're the first to comment, do you want a cookie or something?

[rahulsehrawat]

The code of Github and the code you written is a bit different in python

[krishjain]

Your code will fail for this test case Tree=[1, 2, 3, null, null, 4, 5] with target=3

Since 2 doesnt have any children there wont be any element present in the queue after 3 thus you cannot return the next element of 3.