Data Structure - Part 2

Description

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
• AVL Trees
• Huffman Encoding
• Heap Data Structure
• Disjoint Set

This course is focused on lots of drawings to help you visualize and help you get comfortable with coding the above mentioned data structures. The materials in this course is put in such a way that an average  person without a CS background with some 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 code line by line. We have experienced that mostly  students understand the algorithm but they feel difficulty in understanding the code implementation and its complexity. So, we have given special focused on this point for 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.

For Discount Coupon, please contact us at info@lognacademy.com

Who is the target audience?

• Computer Science and Engineering graduate students
• Fresh and Experienced Developers that want to learn more about Data Structures