IB Computer Science - Topic 5 - Part 3 (Linked Lists, Binary Trees)

Also available are my:
Paper 2, Option C (SL & HL) Study Guide ($3.99):

Link to Slides:

00:00 - Intro
00:54 - Intro to Linked Lists
01:32 - Singly Linked Lists
05:18 - Circular Linked Lists
06:57 - Doubly Linked Lists
09:48 - Traversing Linked Lists
10:38 - Adding New Nodes to Single/Circular LLs
13:27 - Adding New Nodes to Doubly LLs
17:22 - Linked List Practice Problem
21:40 - Intro to Binary Trees
22:43 - Building Binary Trees Example #1
28:14 - Building Binary Trees Example #2
30:43 - Removing/Adding Elements from Binary Trees
35:08 - Traversing Binary Trees
35:25 - Preorder Traversal
36:46 - Inorder Traversal
38:06 - Postorder Traversal
41:00 - Removing the Root Node
43:54 - Binary Tree with Letters/Strings
45:09 - Binary Tree Pros/Cons
46:45 - Binary Trees Practice Problem
49:49 - Rebalancing Binary Trees
52:07 - Wrap Up

[anthonyruan]

omg dices arrows with pre, in, post order is so useful, I have never understand it so clearly

[you-le]

Can you please do Option D also? As there aren't any proper structured sources for OOP specifically for the IB... so it will be really really helpful!
(Also I just want to say by making these vods you are really making our lives easier atleast mine and i'm very greatful for that:)

[XueHuaPiaoPiao]

Hi! I've just done my P1. Thank you so much for these videos!! I used them before my mocks, and before the exam (not cramming hehe) and they have been a life saver for revising
Let's hope the leaks stop 😭

[ChiaraMarcucci]

This saved me so much time. incredible.
For the binary tree question around 49.00, would we still get the marks if we put Larch as our root node instead of Holly or Elm?

[jozkobranko]

I think you are confused about stacks and queues being lifo and fifo, I saw you in the other video made the same mistake. Queue is fifo and stack is lifo. It's just dequeue(first element that was enqueued is the first one that is dequeued) vs pop(last element pushed is the first one popped).

[tz]

wallah you saved me, my mock tommorow and i left topic 5 to the last

[superbly]

Guys, when deleting the root from the binary tree, it has to follow the inorder traversal like the one before deleting it. No need to go through the whole alphabet

[ghikira]

You got the order wrong for post order 49:34

[ikshvakugarg]

hi at timestamp 49.52. instead of elder the post order traversal should start with elm right. pls confirm

[ahsannadeem]

hey. can you please make a video of Alevels 9618 Linked List and Binary Tree surrounding the kinds of question asked
also can you please cover OOP(object oriented programming)

[omarabdelhadi]

Can you please do option c web science