See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have talked about Adjacency List representation of Graph and analyzed its time and space complexity of adjacency list representation. Previous Lesson: https://www.youtube.com/watch?v=9C2cpQZVRBA&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=41 Lesson on Pointers: https://www.youtube.com/watch?v=ASVB8KAFypk https://www.youtube.com/watch?v=sHcnvZA2u88 Time Complexity analysis playlist: https://www.youtube.com/playlist?list=PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn 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

See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have talked about Adjacency Matrix representation of Graph and analyzed its time and space complexity of adjacency matrix representation. Previous Lesson: https://www.youtube.com/watch?v=ZdY1Fp9dKzs&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=40 Time Complexity analysis playlist: https://www.youtube.com/playlist?list=PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn 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

See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have described how we can represent and store a graph in computer's memory as vertex-list and edge-list. We have analyzed the time and space complexities of such a representation. In next two lessons, we will talk about adjacency matrix and adjacency list representations. Next Lesson : https://www.youtube.com/watch?v=9C2cpQZVRBA&index=41&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P Time Complexity analysis playlist: https://www.youtube.com/playlist?list=PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn 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

See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have described below properties of Graph data structure: a) directed graph vs undirected graph b) weighted graph vs unweighted graph c) sparse graph vs dense graph d) strongly connected graphs e) Acyclic graphs. Next Lesson:- https://www.youtube.com/watch?v=ZdY1Fp9dKzs&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=40 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

See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have described Graph data structure as a mathematical model. We have briefly described the concept of Graph and some of its applications. 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

See complete series on C programming here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwLSqGsERZGXGkA5AfMhcknE In this tutorial, we have discussed int data-type in detail. We have explained below concepts: How data is stored in computer's memory. Size and range of int Signed and unsigned int How negative numbers are stored in binary. About binary number system: https://www.youtube.com/watch?v=5OBZYhJnne0 About 2's complement notation: http://www.cs.cornell.edu/~tomf/notes/cps104/twoscomp.html For more such videos and updates, subscribe to our channel: http://www.youtube.com/mycodeschool You may also like/follow us on Facebook/Twitter: https://www.facebook.com/MyCodeSchool https://twitter.com/mycodeschool

In this lesson, we have solved another famous programming interview question - finding maximum sub-array sum in an array. See source codes here: O(n^3) algorithm - https://gist.github.com/mycodeschool/9666221e7527935d8e1d O(n^2) algorithm - https://gist.github.com/mycodeschool/447854ea1844b1b42cd3 O(NlogN) algorithm - https://gist.github.com/mycodeschool/8b4bcff69427c8a6f2aa O(N) algorithm - https://gist.github.com/mycodeschool/4b0b01e1d08932066301 See playlist on programming interview questions here: https://www.youtube.com/playlist?list=PL2_aWCzGMAwLPEZrZIcNEq9ukGWPfLT4A See series on time complexity here: https://www.youtube.com/watch?v=V42FBiohc6c&list=PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn&index=2 Analysis of quicksort: https://www.youtube.com/watch?v=3Bbm3Prd5Fo You may also like/follow us on Facebook/Twitter: https://www.facebook.com/MyCodeSchool https://twitter.com/mycodeschool Video creator : Ashwin Krish - intern at MyCodeSchool

See complete series on C programming here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwLSqGsERZGXGkA5AfMhcknE In this tutorial, we have explained how to use arithmetic operators to perform arithmetic in a C program. For more such videos and updates, subscribe to our channel: http://www.youtube.com/mycodeschool You may also like/follow us on Facebook/Twitter: https://www.facebook.com/MyCodeSchool https://twitter.com/mycodeschool

In this lesson, we have solved a famous programming interview question - finding merge point of two linked list. We have written a C++ implementation. See source code here: https://gist.github.com/mycodeschool/5bc53cb87905f95e12b3 See series on linked list here: https://www.youtube.com/watch?v=NobHlGUjV3g&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=4 See series on time complexity here: https://www.youtube.com/watch?v=V42FBiohc6c&list=PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn&index=2 About sets: http://www.cplusplus.com/reference/set/set/ You may also like/follow us on Facebook/Twitter: https://www.facebook.com/MyCodeSchool https://twitter.com/mycodeschool

See complete series on C programming here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwLSqGsERZGXGkA5AfMhcknE In this tutorial, we have explained printf and scanf functions in C that are used to read input and write output from command line or Console. For more such videos and updates, subscribe to our channel: http://www.youtube.com/mycodeschool You may also like/follow us on Facebook/Twitter: https://www.facebook.com/MyCodeSchool https://twitter.com/mycodeschool

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

See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have written code to find height of a binary tree using a simple recursion. 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

See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have discussed deletion of a node from binary search tree data structure. We have discussed the core logic and written implementation of it in C++. See source code here: https://gist.github.com/mycodeschool/9465a188248b624afdbf 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

See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have written a program in C/C++ to verify whether a given binary tree is binary search tree or not. 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

See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have described Preorder, Inorder and Postorder algorithms for binary tree traversal and analyzed their time and space complexities. See source code here: https://gist.github.com/mycodeschool/10016271 For more on time complexity analysis: http://www.geeksforgeeks.org/618/ 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