# Data structures I

Other,

Updated On 02 Feb, 19

Other,

Updated On 02 Feb, 19

Introduction to data structures - Data Structures: List as abstract data type - Introduction to linked list - Data Structures: Arrays vs Linked Lists - Linked List - Implementation in C/C++,Linked List in C/C++:Inserting a node at beginning,Insert a node at nth position,Delete a node at nth position - Reverse a linked list - Iterative method - Print elements of a linked list in forward and reverse order using recursion - Reverse a linked list using recursion - Data structures: Introduction to Doubly Linked List - Doubly Linked List - Implementation in C/C++ - Data structures: Introduction to stack - Data structures: Array implementation of stacks - Data Structures: Linked List implementation of stacks - Reverse a string or linked list using stack - Check for balanced parentheses using stack - Infix, Prefix and Postfix - Evaluation of Prefix and Postfix expressions using stack - Infix to Postfix using stack - Data structures: Introduction to Queues,Array implementation of Queue,Linked List implementation of Queue,Introduction to Trees,Binary Tree,Binary Search Tree - Binary search tree - Implementation in C/C++ - BST implementation - memory allocation in stack and heap - Find min and max element in a binary search tree - Find height of a binary tree - Binary tree traversal - breadth-first and depth-first strategies - Binary tree: Level Order Traversal - Binary tree traversal: Preorder, Inorder, Postorder - Check if a binary tree is binary search tree or not - Delete a node from Binary Search Tree - Inorder Successor in a binary search tree - Data structures: Introduction to graphs - Data structures: Properties of Graphs - Graph Representation:Edge List,Adjacency Matrix

- On-demand Videos
- Login & Track your progress
- Full Lifetime acesses

4.1 ( 11 )

See complete series on data structures here

httpwww.youtube.complaylist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P

In this lesson, we have described Infix , Prefix and Postfix notations which are ways of writing arithmetic and logical expressions. Infix notation is the most common way of writing expressions. Prefix and Postfix notations are other two ways that are good for machines because they can be parsed and evaluated easily. This is one important topic in computer science where we find application of stack data structure.

For practice problems and more, visit httpwww.mycodeschool.com

Like us on Facebook httpswww.facebook.comMyCodeSchool

Follow us on twitter httpstwitter.commycodeschool

Sam

Sep 12, 2018

Excellent course helped me understand topic that i couldn't while attendinfg my college.

Dembe

March 29, 2019

Great course. Thank you very much.