See complete series on data structures here:
http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
In this lesson, we have written a program to find minimum or maximum element in a "binary search tree" data structure. We have written two solutions - iterative and recursive.
For practice problems and more, visit: http://www.mycodeschool.com
Like us on Facebook: https://www.facebook.com/MyCodeSchool
Follow us on twitter: https://twitter.com/mycodeschool
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.