Binary trees are arguably the most important data structure out there with binary tree problems being incredibly popular with tech interviewers, especially at FAANG. Use this course to familiarize yourself with this topic and its critical algorithms like breadth-first and depth-first traversal.
If you need additional support taking those skills and actually applying them, take Alvin's complete data structures and algorithms course on Structy. You can try out the concepts yourself in their interactive code editor and learn advanced DSA patterns like stack exhaustive recursion.
Use this link to get 20% off the entire Structy DSA learning experience (discount code TARO20).