In the second part of Data Structure course, we are going to cover following topics

• Binary Trees

• Binary Search Trees

• Tree Traversal

• Morris Traversal

• Threaded Binary Trees

• AVLTrees

• Huffman Encoding

• Heap Data Structure

• Disjoint Set

This course is focused onlotsof drawings to help you visualize and help you get comfortable with coding the above mentioneddata structures. The materials in this course is put in such a way that an averageperson without a CS background withsome knowledge of basic Java programming.

In addition to that, we have explained not only Data Structure and its relevant algorithm, but also the instructor has debugged the code and explained the flow of codeline by line. We have experienced that mostly studentsunderstand the algorithm but they feel difficulty inunderstanding the code implementationand its complexity. So, we have given specialfocused on this pointfor the convenience students.

We would strongly suggest you to please give us your feedback and valuable input.

Also, suggest us the topics on which you would like to see more courses.