1
00:00:00,720 --> 00:00:02,290
Hello, everyone, and welcome back.

2
00:00:03,060 --> 00:00:07,830
In this section, we're going to continue with what we learned about interface design, but we're going

3
00:00:07,830 --> 00:00:12,120
to extend into yet another data structure this time.

4
00:00:12,120 --> 00:00:15,510
This data structure is called a tree or a tree.

5
00:00:15,930 --> 00:00:20,400
And just like its name, it is a variation of a tree.

6
00:00:20,670 --> 00:00:24,680
In this particular case, it's a variation of an energy tree.

7
00:00:24,900 --> 00:00:28,680
And this data structure particularly holds strings.

8
00:00:29,140 --> 00:00:35,520
This is a data structure that's very useful when you need to quickly search up different words or characters

9
00:00:35,520 --> 00:00:37,650
as long as they're based on strings.

10
00:00:38,100 --> 00:00:44,490
If you're unfamiliar with TREIS, I have linked in your resources a quick video that Andrew has done

11
00:00:44,490 --> 00:00:45,960
going through what they are.

12
00:00:46,230 --> 00:00:53,070
The key to remember here is that they are a form of energy tree, but with a very specific purpose of

13
00:00:53,070 --> 00:00:55,450
helping us quickly search up words.

14
00:00:55,830 --> 00:01:02,340
So check out that video that Andrea has done in the resources inside of your appendix and then come

15
00:01:02,340 --> 00:01:06,690
back and we will tackle a question that involves a tri.