DSA Learning Series - Session 2 - Binary Search Trees & Tree Questions

Hi there!

This is our online learning series to get beginners kickstart with DSA concepts and start solving coding challenges instantly.

Here are the things that we will cover in session 2:

1. Vertical Traversal & Diagonal Traversal
2. Zig-Zag Traversal
3. Binary Search Tree
4. Search, Insertion, Deletion in Binary Search Tree
5. Balanced Binary Search Tree (BBST) and applications
6. Check balance condition in BBST
7. leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal
8. Lowest-Common Ancestor in Binary Tree 
9. Lowest-Common Ancestor in Binary Search Tree (if time left at the end of session)

So, join our session if you think it will help you in achieving your goals!