Find Your Perfect Study Partner

Connect with students in your year and modules for productive study sessions

🎯

Match by Module

Find partners studying the same subjects as you

📅

Flexible Scheduling

Create sessions that fit your timetable

⭐

Rated Partners

Choose partners based on peer reviews

Welcome Back

Sign in to continue to Study Buddy

Don't have an account? Sign up

Create Account

Join Study Buddy to find study partners

Already have an account? Sign in

Browse Study Sessions

Find and join study sessions that match your needs

Create Study Session

Set up a new study session and find partners

Session Details

Schedule

Preferences

RB

Raul Blanco

Year 2

raul.blanco@university.ac.uk

★★★★☆ (12 ratings)
5
Sessions Created
8
Sessions Joined
4.2
Avg Rating

My Sessions

CS201 Exam Prep

LIVE
Module: CS201 - Data Structures
Date & Time: Today at 14:00
Duration: 90 minutes
Participants: 3/4
Host: Raul B.

Preparing for the CS201 midterm exam. Focus on binary trees, graph traversal algorithms, and hash tables. Bring your notes!

discussion practice

Session Chat

Demo Mode
Participants 3
RB
Raul B. (You)
SK
Sarah K.
JD
James D.
Sarah K. 14:02
Hey everyone! Should we start with binary trees?
You 14:03
Sounds good! Here's the traversal code we covered:
You 14:03 
pythondef inorder(node):
    if node:
        inorder(node.left)
        print(node.val)
        inorder(node.right)
James D. 14:04
Nice! The /code command is really handy for sharing snippets
Sarah K. 14:05
What about the time complexity for balanced vs unbalanced BSTs?
You 14:06
Balanced is O(log n) for search/insert/delete. Unbalanced worst case is O(n) — basically a linked list.
James D. 14:07 
java// BFS traversal using a queue
public void bfs(TreeNode root) {
    Queue<TreeNode> queue = new LinkedList<>();
    queue.add(root);
    while (!queue.isEmpty()) {
        TreeNode node = queue.poll();
        System.out.print(node.val + " ");
        if (node.left != null) queue.add(node.left);
        if (node.right != null) queue.add(node.right);
    }
}