Trees and Binary Search Trees

About this course

Binary trees, BST operations, tree traversals (inorder, preorder, postorder), balanced trees (AVL, red-black).

• 20 lessons
• 2 h
• intermediate

What you'll learn

• Describe the scope and structure of the course
• Explain why tree data structures are widely used in computing
• Define core tree terminology accurately
• Identify parent-child and ancestor-descendant relationships
• Define a binary tree and distinguish it from general trees
• Calculate height, depth, and level of nodes

Finishing the course

• 80 knowledge-check questions along the way, so you know the ideas stuck before you move on.
• Watching is free and needs no account. Sign in to save your progress. Pass each lesson's quiz (60%+) to earn the certificate. Each certificate has its own public verification link to share, marked quiz-verified.

Created by