Inorder Successor in a binary search tree
By mycodeschool
Community Score: 50% | 377.3K 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 discussed efficient algorithm to find Inorder successor of a Node in binary search tree. See source code here: https://gist.github.com/mycodeschool/6515e1ec66482faf9d79 See video on Inorder Traversal here: https://www.youtube.com/watch?v=gm8DUJJhmY4 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, code, program, job, interview, software, Computer Science (Industry), Tree Traversal, yt:cc=on
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%