Find min and max element in a binary search tree
By mycodeschool
Community Score: 50% | 373.9K views | 12y
0 community ratings: null thumbs up, null thumbs down
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
Tags: data structures, Binary Search Tree, coding, programming, my code school, yt:cc=on, interview, job
More from mycodeschool
- Introduction to programming and programming languages: C Programming Tutorial 01 — Score: 50%
- Graph Representation part 03 - Adjacency List — Score: 50%
- Graph Representation part 02 - Adjacency Matrix — Score: 50%
- Graph Representation part 01 - Edge List — Score: 50%
- Data structures: Properties of Graphs — Score: 50%
- Data structures: Introduction to graphs — Score: 50%