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.
Java Data Structures and Algorithms
·
Module 6
Trees: Traversals and Problems
1
Tree Traversal Techniques
Implement preorder, inorder, and postorder traversals, both recursively and iteratively.
2
Level-Order Tree Traversal with Queues
Implement level-order traversal of a binary tree using a queue.
3
Binary Tree Dimensions
Calculate the height, diameter, and size of a binary tree.
4
Binary Tree Views: Left and Right
Solve problems to find the left and right view of a binary tree.
5
Tree View Traversal: Top and Bottom
Solve the 'top view' and 'bottom view' of a binary tree problem.
6
Finding the Lowest Common Ancestor (LCA)
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
7
Building Binary Trees from Traversals
Construct a binary tree from its preorder and inorder traversals.
8
Building a Binary Tree from Traversals
Construct a binary tree from its postorder and inorder traversals.
Previous module
Stacks, Queues, and Deques
Next module
Search Trees, Heaps, and Priority Queues