tl;dr

study less.
remember more.

AI turns your lecture notes into a structured guide you'll actually read.

Start studying free →See how it works ↓

No credit card. Works with PDFs, slides, and plain text.

See it in action

From notes to guide in seconds.

Here's a sample guide — right-click any section to ask a question.

Data Structures — Week 4
BST — Week 4 Guide
4 elements · right-click any section to ask

Binary Search Trees

A binary search tree (BST) is a node-based data structure where each node has at most two children. For any node, all values in the left subtree are smaller, and all values in the right subtree are larger — this is the BST invariant.

def search(node, target):
    if node is None or node.val == target:
        return node
    if target < node.val:
        return search(node.left, target)
    return search(node.right, target)
T(n)=O(log⁡n) (average case)T(n) = O(\log n) \text{ (average case)}
Upload your own notes to generate a guide like thisTry it free →
How it works

Three steps to a better study session.

01
Upload your material
PDFs, slides, lecture notes, or plain text. Any format, any subject.
02
Get a structured guide
AI breaks it into sections with explanations, formulas, code blocks, and timelines.
03
Ask about anything
Right-click any section and ask questions. The AI explains using your own material.

ready to study smarter?

Free to get started. No credit card required.

Create your first guide →Sign in