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.
Elite Computer Science Mastery
·
Module 3
Hierarchical Data Structures: Trees, Tries, and Heaps
Binary Tree Traversals (Recursive & Iterative)
Implement binary trees with recursive and iterative traversals (in-order, pre-order, post-order, level-order).
Implementing BST: Insert, Search, Delete
Implement a Binary Search Tree (BST) supporting insertion, search, and deletion operations.
3
Solving Tree Problems: Height, Diameter, and Maximum Path Sum
Solve classic tree problems, including calculating height, diameter, and maximum path sum.
4
Binary Heaps and Priority Queues
Implement a binary heap (priority queue) and apply it to problems like finding the 'Kth' largest element.
5
Finding the Lowest Common Ancestor (LCA)
Find the Lowest Common Ancestor (LCA) of two nodes in both a binary tree and a BST.
6
Tries: Autocomplete and Prefix Search
Implement a Trie (prefix tree) and apply it to solve prefix-based search problems like autocomplete.
7
AVL Tree Rotations for Self-Balancing BSTs
Explain the principles of self-balancing BSTs using AVL tree rotations as a concrete example.
Previous module
Linear Data Structures and Common Patterns
Next module
Hashing, Sets, and Range Queries