Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Learn Python programming
·
Module 9
Binary Trees and Traversals
1
Binary Trees: Node Class Representation in Python
Represent binary trees using node classes in Python
2
Recursive Tree Traversal: Preorder, Inorder, Postorder
Implement recursive preorder, inorder, and postorder traversals
3
Iterative Inorder Traversal with a Stack
Implement iterative inorder traversal using a stack
4
Level Order Traversal with Queues
Implement level-order traversal using a queue
5
Tree Properties: Height and Diameter
Solve problems involving tree properties, such as calculating height or diameter
6
Lowest Common Ancestor in a Binary Tree
Find the lowest common ancestor of two nodes in a binary tree
Previous module
Heaps and Priority Queues
Next module
Binary Search Trees