Uploaded May 2014 | Updated November 2026, 3 hours ago
See complete series on data structures here:
youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
In this lesson, we have discussed efficient algorithm to find Inorder successor of a Node in binary search tree.
See source code here:
gist.github.com/mycodeschool/6515e1ec66482faf9d79
See video on Inorder Traversal here:
youtube.com/watch?v=gm8DUJJhmY4
For practice problems and more, visit: mycodeschool.com
Like us on Facebook: facebook.com/MyCodeSchool
Follow us on twitter: twitter.com/mycodeschool
See complete series on data structures here:
youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
In this lesson, we have discussed efficient algorithm to find Inorder successor of a Node in binary search tree.
See source code here:
gist.github.com/mycodeschool/6515e1ec66482faf9d79
See video on Inorder Traversal here:
youtube.com/watch?v=gm8DUJJhmY4
For practice problems and more, visit: mycodeschool.com
Like us on Facebook: facebook.com/MyCodeSchool
Follow us on twitter: twitter.com/mycodeschool



![Verify a Prime number - Trial division method
See complete series on maths problems here:
http://www.youtube.com/playlist?list=PL2_aWCzGMAwLL-mEB4ef20f3iqWMGWa25&feature=view_all
In this lesson, we will write a simple program to verify whether a given number is prime or not. The tutorial only describes the algorithm and gives a pseudo-code.
Prerequisite: Knowledge of basic programming constructs like loop.
www.mycodeschool.com is a not for profit educational initiative. You can send your feedback to mycodeschool [at] gmail [dot] com Verify a Prime number - Trial division method](https://i.ytimg.com/vi/7VPA-HjjUmU/mqdefault.jpg)






