Trees, Binary Trees, and Binary Search Trees - Questions and Explanations

Learn fundamental tree data structures and algorithms through a comprehensive tutorial covering binary trees, binary search trees, and advanced tree operations. Master essential concepts including tree serialization and deserialization using recursive solutions, finding lowest common ancestors between nodes, and performing bidirectional searches to locate nodes at specific distances. Explore level order traversal techniques by understanding the relationship between trees and graphs, and gain proficiency in the three main traversal methods: preorder, inorder, and postorder. Implement a binary heap as an efficient priority queue abstract data type, and develop skills to test tree properties such as height balance and symmetry. Discover how to count unique binary search trees using dynamic programming and the nth Catalan number formula. Build a solid foundation in tree algorithms essential for technical interviews and software engineering roles through hands-on problem-solving approaches.

Syllabus

Serialize & Deserialize A Binary Tree - Crafting Recursive Solutions To Interview Problems
Lowest Common Ancestor Between 2 Binary Tree Nodes (A Recursive Approach)
All Nodes Distance K In A Binary Tree - Performing Bidirectional Search On A Tree Using A Hashtable
Binary Tree Level Order Traversal - Drawing The Parallel Between Trees & Graphs
Binary Tree Bootcamp: Full, Complete, & Perfect Trees. Preorder, Inorder, & Postorder Traversal.
Implement A Binary Heap - An Efficient Implementation of The Priority Queue ADT (Abstract Data Type)
Test If A Binary Tree Is Height Balanced ("Balanced Binary Tree" on LeetCode)
Count Total Unique Binary Search Trees - The nth Catalan Number (Dynamic Programming)
Test If A Binary Tree Is Symmetric ("Symmetric Tree" on Leetcode)