095. OCR A Level (H446) SLR14 – 1.4 Data structures part 4 – Trees (operations)
About this video
OCR Specification Reference
A Level 1.4.2c
This video walks you through how to create, traverse, add data to and remove data from the following data structure: Trees. If you haven't already go back and watch the introductory video on this data structure.
Key questions:
- How do binary trees work?
- How do you create a binary tree?
- How do you add a data item to a binary tree?
- How do you remove a data item from a binary tree?
- How do you traverse a binary tree?
00:00 Tree operations
00:10 Intro
00:15 A note about this video
00:30 Traversing, adding to and removing from a binary tree
01:03 Adding an item to a binary tree
03:00 Removing an item from a binary tree
08:59 Does it have to be this complicated?
10:01 Traversing a binary tree
10:31 Traversing a binary tree using pre-order traversal
11:23 Traversing a binary tree using in-order traversal
12:24 Traversing a binary tree using post-order traversal
13:06 Traversing a binary tree continued
13:25 Key questions
13:42 Essential algorithms for A Level Computer Science text book
14:46 Outro
Last updated: 22.07.26
Other videos on this course
-
085. OCR A Level (H046-H446) SLR14 – 1.4 Arrays, records, lists & tuples
-
086. OCR A Level (H046-H446) SLR14 – 1.4 Tuples, static or dynamic
-
087. OCR A Level (H446) SLR14 – 1.4 Data structures part 1 – Linked lists
-
088. OCR A Level (H446) SLR14 – 1.4 Data structures part 2 – Graphs
-
089. OCR A Level (H046-H446) SLR14 – 1.4 Data structures part 3 – Stacks & queues