Binary Tree Inorder Traversal
Implement an inorder traversal function that returns node values in left-root-right order.
Preorder Traversal
Implement a function that returns the preorder traversal values of a binary tree.
Postorder Traversal
Implement a function that returns the postorder traversal of a binary tree as a list of node values.
Symmetric Tree Check
Write a function that checks whether a binary tree is symmetric (a mirror of itself).
Same Tree Check
Write a function that checks whether two binary trees are identical in structure and node values.
Lowest Common Ancestor in a Binary Tree
Implement a function to find the lowest common ancestor (LCA) of two nodes in a binary tree.
Delete Node in BST
Implement a function that deletes a key from a binary search tree and returns the new root.
Trim BST to range
Implement a function to trim a BST to only retain nodes with values in a given inclusive range.
Showing 8 challenges · Trees & Binary Trees
Trees & Binary Trees — Python coding challenges
What you will find here
This page lists trees & binary trees challenges — real Python problems you solve in the browser IDE with instant test feedback. Each challenge includes a clear brief, starter code, and automated checks.
Challenges vs tutorials and quizzes
Challenges test what you can build under constraints. For guided teaching, use our Python tutorials. For quick checks, try quizzes or copy snippets from code samples.