[User] Please transcribe this text

[Assistant] Because you have to calculate it for every node. We did it for every node and it is not more than k, which we are considering as 1. Okay? So I hope you are getting this. Now let's calculate the same height of left and right subtree for this second example. So 1 being the root node, the two different subtrees, that is the left subtree is this one and this is the entire right subtree, right? So for this as the left subtree, what is the height?


[User] Please transcribe this text

[Assistant] So this has to be the root for this subtree and the height of this tree is gonna be the number of edges from the root.


[User] Please transcribe this text

[Assistant] 6 to 8, but we can go from 6 to 7 and 7 to 9, so 2 hops over here, 2 and 3. So the height of


[User] Please transcribe this text

[Assistant] Right subtree is you can say 1, 2 and 3. So, I will write 3 over here and the difference


[User] Please transcribe this text

[Assistant] Between the two is 1 minus 3. You have to take absolute difference. So you have mod and height of left subtree minus height of right subtree. So 1 minus 3.


[User] Please transcribe this text

[Assistant] So now this is not a balanced binary tree because the difference between height of left subtree and right subtree


[User] Please transcribe this text

[Assistant] And in future videos, we'll understand how to convert this unbalanced binary tree into a balanced binary tree. And the reason why we want a balanced binary tree is because the traversal of a balanced binary tree is more cost efficient when it comes to accessing the different nodes. And if it is unbalanced, reaching the leaf nodes from the root takes more time. So if this was a balanced tree, 7 could have come over here, 8 could have gone over here, and 9 could have gone over here.


[User] Please transcribe this text

[Assistant] And you can see we get one less level. So accessing 9 will take one unit less time.


[User] Please transcribe this text

[Assistant] And how to understand which tree is a balanced binary tree and not. So I hope you got the calculation and the definition of a balanced binary tree. So let's move forward to the last


[User] Please transcribe this text

[Assistant] topic of this video, which is how you can implement a binary tree data structure.


[User] Please transcribe this text

[Assistant] Now in the previous tutorial we saw one type of implementation of binary tree and that is as dynamic nodes in the memory. When I say that you just create a node.


[User] Please transcribe this text

[Assistant] You can see I've created a node n1 in the memory, add some address hash 10.


[User] Please transcribe this text

[Assistant] Then you create node n2 at some other address hash 23 and for node n1 as the left pointer


[User] Please transcribe this text

[Assistant] You assign N2, so N2's address of 23 is stored as the left child address.


[User] Please transcribe this text

[Assistant] And for the right child you assign n3 which is again created at some other memory location hash 27. So hash 27 is stored over here as the right child.


[User] Please transcribe this text

[Assistant] And pretty much that goes ahead also. You can see we've created N4 at hash 73 and that is stored as left child in N2's left pointer.


[User] Please transcribe this text

[Assistant] And for the right, you have hash 66, which is N5's address and so on and so forth.


[User] Please transcribe this text

[Assistant] So this is how you pretty much create linked list also. So similarly you can create binary tree as dynamic nodes in the memory and link them using the left and right pointer methodology. But there is one more way.


[User] Please transcribe this text

[Assistant] Yes, you can create binary trees in arrays. So array is another data structure, but you can use it to work like a binary tree. So how does that work?


[User] Please transcribe this text

[Assistant] So let's say we have this binary tree. Every binary tree has different nodes. So this node has value of 4, which is the root node. So this is the root node.


[User] Please transcribe this text

[Assistant] Then we have it's child node that is left child and right child and both have value of 9 and 3. So this binary tree is storing integer values. Let's just assume it is storing integer values. 4, 9, 3. Then we have 1, 5, 7 and 2.


[User] Please transcribe this text

[Assistant] Okay, so in the pink over here what I've done is I've just named these nodes starting from 0 and from left to right level by level. So for


[User] Please transcribe this text

[Assistant] Again I've said 3, 4, 5, 6. So I've named them chronologically from top to bottom from left to right. So 0, 1, 2, 3, 4, 5, 6. And at the bottom you can see we have a basic array, arr. And what we've done is, in the array,


[User] Please transcribe this text

[Assistant] So at every index i, so this is the array index 0, 1, 2, 3, 4, 5, 6, obviously array index starts from 0.


[User] Please transcribe this text

[Assistant] And for every index, the way we store the value for this binary tree is given by this formula. For left child, you have to say 2i plus 1. So, the first root value is stored as it is. So, root value is 4 you can see.


[User] Please transcribe this text

[Assistant] So this is the index position 0, and 0 index position we've stored 4.


[User] Please transcribe this text

[Assistant] Of course the root node has a left child LC and right child RC. LC is 9. So 9, where do we store in this array? It is given by this formula 2i plus 1.


[User] Please transcribe this text

[Assistant] So for the node at index i, so which node is there at index i? It is the root node and the index value is zero. So for the node


[User] Please transcribe this text

[Assistant] For left child, so i is 0, so when you substitute 0, this becomes 0. And the left child, you get the value of 1.


[User] Please transcribe this text

[Assistant] So what is left child equal to 1? It is the index position 1.


[User] Please transcribe this text

[Assistant] Where the left child is stored. So nine is stored at index position one. Similarly for right child.


[User] Please transcribe this text

[Assistant] Let me write it over here. Rc, we have the formula 2i plus 2.


[User] Please transcribe this text

[Assistant] So again the root node is at index 0, so we substitute 0, so we get 2. So at index position 2, we store the right child for the root node. So the root node for left child is 9, for the right child is 3. Now again for 9, you have left child and right child.


[User] Please transcribe this text

[Assistant] So how do you calculate where you store these children in the array?


[User] Please transcribe this text

[Assistant] With the same formula. And the formula is shown over here on the screen. You can try and


[User] Please transcribe this text

[Assistant] Apply it yourself and you'll get the different index positions where the values have to be stored for the left and right child for every node. And this is how you can store data in an array for a binary tree.


[User] Please transcribe this text

[Assistant] So binary tree data can be stored as conventional arrays also.


[User] Please transcribe this text

[Assistant] But typically it is done for perfect binary trees because all the nodes have to be filled. Otherwise, we will have some gaps in the array where the values will not be stored. Okay.


[User] Please transcribe this text

[Assistant] Okay, so this was a detailed video on binary tree data structure and the different variations, the different terms, the different properties. And we also saw what is dense tree, what is sparse tree, what is a balanced tree.


[User] Please transcribe this text

[Assistant] Lastly, we also saw the implementation side of a binary tree data structure and the options in which you can implement a binary tree data structure.


[User] Please transcribe this text

[Assistant] So I hope you've understood the entire concept of binary tree data structure as we move ahead. We'll see more different variations.


[User] Please transcribe this text

[Assistant] And we'll also go through the implementation of binary tree data structure.


[User] Please transcribe this text

[Assistant] Do share it with your friends and I'll see you guys in the next one. Peace.


[User] Please transcribe this text

[Assistant] Yo, what's going on guys? Tanmay here for simple snippets and welcome back to another video tutorial on data structures and algorithms. And as the title of the video suggests in today's video,


[User] Please transcribe this text

[Assistant] If you missed any of the previous tutorials, we've already discussed what is a tree, what is a binary tree, what is a binary search tree. We even started with the implementation of binary search tree.


[User] Please transcribe this text

[Assistant] And then lastly, we took a look at the different tree traversal techniques and we took the working as well as the diagrammatic examples in the previous tutorial. So, if you missed that, if you don't know what is tree traversal, please do check out the previous tutorials in this course.


[User] Please transcribe this text

[Assistant] Now if you already know what is Street Reversal and if you've seen the previous tutorial and if you have an overview of the working of preorder, then you're good to go.


[User] Please transcribe this text

[Assistant] In this tutorial, we're gonna take a look at the pseudocode as well as we're gonna write a C++ program to implement this preorder technique. Okay?


[User] Please transcribe this text

[Assistant] So make sure you watch this video till the end if you want to have the practical knowledge as well. And with that being said, let's get started.


[User] Please transcribe this text

[Assistant] If you're new to my channel, my name is Tanmay Sakpal and I do a lot of computer science and information technology video tutorials like computer programming, development, technology talks and a lot more on this channel. So if that's something you're interested into, then definitely subscribe and turn on the notifications to get the latest updates and never miss out on such important topics.


[User] Please transcribe this text

[Assistant] This is something we saw in the previous tutorial as well.


[User] Please transcribe this text

[Assistant] And at the bottom in the blue, we have the pseudo code, which looks like a function, part function, part English, which essentially we will be using to convert into C++. Okay. So in order to write a program, a pseudo code is much more easier to, you know, directly convert into a code rather than proper plain English. Okay. And on the right hand side, we have a binary search tree wherein we have the different nodes linked to each other. So this is the root node.


[User] Please transcribe this text

[Assistant] The name of the node, the address in the memory that this node is created. So n1 is created in the memory address hash 31. Okay, so that's its memory address. Of course, this memory is not real. We are just using it for understanding purpose because ultimately we want to write a program, right? So hence we are using this kind of diagram. Now in the node, we have the value in the center.


[User] Please transcribe this text

[Assistant] The value is also termed as key at times, it is also known as data.


[User] Please transcribe this text

[Assistant] And the left part is the address which links to the left child. And the right part is the address which links to the right child.


[User] Please transcribe this text

[Assistant] And this is common to all the different nodes. It's pretty understandable. Okay.


[User] Please transcribe this text

[Assistant] Now this is a binary search tree which means that it follows the principle where for a particular node, the left subtree has lesser values. So for node n1,


[User] Please transcribe this text

[Assistant] The entire left subtree has values 18, 10 and 25, which is less than 30. And for the right subtree, which is this part, all the values are greater.


[User] Please transcribe this text

[Assistant] So that's the basic principle of a binary search tree. I'm guessing you guys already know that. We are taking a binary search tree for


[User] Please transcribe this text

[Assistant] Are understanding and because we begin with the implementation of binary search tree in previous tutorials, especially with the insertion.


[User] Please transcribe this text

[Assistant] But the same technique will be applicable to a regular binary tree as well because structurally both of them are same, but the values are different when it comes to the storing. Okay?


[User] Please transcribe this text

[Assistant] So all these tree traversal techniques that we're discussing will be applicable to a general binary tree as well as a binary search tree. Okay, so now that's out of the way.


[User] Please transcribe this text

[Assistant] The last thing that you need to understand this tutorial thoroughly is the concept of recursion or recursive functions.


[User] Please transcribe this text

[Assistant] Because recursion is gonna be used in the pseudo code in the code itself.


[User] Please transcribe this text

[Assistant] Now if you don't know what is recursion, I have a separate dedicated video with C++ which explains the concept of recursion.


[User] Please transcribe this text

[Assistant] If you have the basic understanding, you'll understand this video very well. But I would highly recommend if you're a beginner, just watch that video that is very important. I'll link that in the video description or you can see a card. But now let's get to the pseudocode.


[User] Please transcribe this text

[Assistant] Okay, so in previous tutorial, I discussed the three steps that are required when it comes to pre-ordered tree traversal.


[User] Please transcribe this text

[Assistant] The second step is traverse the left subtree which corresponds to left. And the third step is traverse the right subtree by using recursion. So step two and step three are recursion. Step number one is to access the current node. Okay, now coming to our pseudocode.


[User] Please transcribe this text

[Assistant] We have the same three steps in the form of pseudocode. However, there is one extra step which is step number one which is basically the stopping condition.


[User] Please transcribe this text

[Assistant] Because if you give a recursive call infinitely, your program will go in an infinite loop and it will crash.


[User] Please transcribe this text

[Assistant] So when it comes to the implementation, when it comes to the practical side, of course you need to write the code in such a way that there has to be a condition where the recursion will stop. And that is this step.


[User] Please transcribe this text

[Assistant] Now I know it might not make sense as of now, but don't worry, we're gonna run this entire preorder pseudocode step by step recursively with the help of diagrams so you'll understand everything that this condition as well as the different steps. But this is one extra step which is used to stop the recursion, okay?


[User] Please transcribe this text

[Assistant] So this is the function named print preorder because we're gonna print all the values and we're gonna traverse in a preorder way. So even though this is a traversal,


[User] Please transcribe this text

[Assistant] We are basically gonna print the values, hence the output column over here, which we will populate when we will traverse the entire BST tree.


[User] Please transcribe this text

[Assistant] T star R basically is nothing but the address of the particular node.


[User] Please transcribe this text

[Assistant] When I say address, it is because we are gonna write a C++ program. We are gonna deal with pointers. So that's why this syntax.


[User] Please transcribe this text

[Assistant] And then we have the step number 2, 3 and 4 which is exactly the same as these three steps which are in plain English. Step number 2 is to printing the value that is the access the data part.


[User] Please transcribe this text

[Assistant] Step number three is calling print preorder on the left subtree, hence R of left.


[User] Please transcribe this text

[Assistant] R would be the current node and R of left would be the left child.


[User] Please transcribe this text

[Assistant] Step number four is again a recursive call to R of right, which is the right child. So these two steps are nothing but recursion. Okay? Alright, so now that we have a basic overview, let's directly implement this function onto our existing binary search tree.


[User] Please transcribe this text

[Assistant] So let's call print preorder for the first time and we will obviously start from the root. So this is the root node. So for the first time we will pass n1.


[User] Please transcribe this text

[Assistant] So n1 will be passed in this function, so r will be corresponding to n1. Okay? Alright, so let's see the first call. That is the first function call. Okay, so this is the very first print preorder function call. We are passing n1. Now this is not a recursive call because for the first time,


[User] Please transcribe this text

[Assistant] From the main function, we are simply calling print preorder. Okay? Alright.


[User] Please transcribe this text

[Assistant] So starting from the very first line, that is the first line of code,


[User] Please transcribe this text

[Assistant] In the print preorder, the first line is a condition which says if r equal equal to null, then return.


[User] Please transcribe this text

[Assistant] Return means just stop this function over here and return to the calling function. So in the main function we will call print preorder.


[User] Please transcribe this text

[Assistant] And when we do the return, we will come from print preorder to the main function back. That's how the function call work.


[User] Please transcribe this text

[Assistant] And n1 is obviously not null, it is created in the memory at hash 31, so it is not null.


[User] Please transcribe this text

[Assistant] So this condition becomes false, right? We are checking if r equal equals to null. r is not null, r is pointing to n1. So this condition becomes false, hence we move forward to step 2. Now in step 2, we say print r of value. r is currently pointing to n1.


[User] Please transcribe this text

[Assistant] What is n1's value? That is the value stored inside n1, it is 30. So we are saying print r of value.


[User] Please transcribe this text

[Assistant] So now 30 will be printed in the output on the command prompt when we write the C++ code. So let's write output over here, I'll write 30 and this is the very first value being printed. Okay, alright. Step 2 is done now, we move to step 3.


[User] Please transcribe this text

[Assistant] Now this is where step 3 is a recursive call, because you can see the name is the same, that is print preorder. We're giving a recursive call, but this time the node that we're passing is equal to r of left. Currently r is pointing to n1, right?


[User] Please transcribe this text

[Assistant] Which node is there to the left of N1? This is hash 16. What is hash 16? Hash 16 is the address of N2. You can see over here. Hash 16 is nothing but the address of N2. So basically we are passing N2 over here in the


[User] Please transcribe this text

[Assistant] Okay, so as you can see, we have a second function call.


[User] Please transcribe this text

[Assistant] Which is our very first recursive call to the same function print preorder, but this time we are passing n2.


[User] Please transcribe this text

[Assistant] Now, the first print preorder gave a call to second print preorder over here at step 3.


[User] Please transcribe this text

[Assistant] So what will happen to the first print preorder call? Because you can see that the first print preorder call is at step 3. It still has to do the step 4.


[User] Please transcribe this text

[Assistant] Print preorder function will go in a pause state. So let me do a pause symbol over here.


[User] Please transcribe this text

[Assistant] And it is paused at step number 3. Because at step number 3, it gave another call to print preorder. So, it's a recursive call. So, let me write 3 over here.


[User] Please transcribe this text

[Assistant] So the first print preorder where we passed n1 is now paused at step number 3. It still has to do step number 4 because only after completing all the steps in the function will a function be completely over, right?


[User] Please transcribe this text

[Assistant] But it got paused at step 3 because it gave a recursive call. So hence it goes in a pause state and


[User] Please transcribe this text

[Assistant] This first print preorder is calling second print preorder. Okay, alright.


[User] Please transcribe this text

[Assistant] Now when you give a second print preorder call, you're passing n2. Again, this four steps that is this entire function will be started from the very first step. So let's do that. This time the R is going to be n2. Let's write n2 over here.


[User] Please transcribe this text

[Assistant] Again coming to step number 1, if r equal equal to null, then return. Is r null? No. r is currently pointing to n2 and n2 is existing in the memory, it is not null. So this step will not be true. We will not return, we will continue. We will go to step 2, we will say print r of value. Currently, r is pointing to n2. What is the value inside n2? It is 18. So we want to print that, we will write 18 over here. Okay.


[User] Please transcribe this text

[Assistant] Which means R is over here. Who's to the left of N2?


[User] Please transcribe this text

[Assistant] It is the address hash 6 and hash 6 is the address of n4. You can see.


[User] Please transcribe this text

[Assistant] So basically now we are giving another recursive call and we are passing n4 this time. So let's see that recursive call.


[User] Please transcribe this text

[Assistant] So now a third function call is given from second function print preorder to


[User] Please transcribe this text

[Assistant] Third print preorder and this time we are passing n4 and obviously since second print preorder was paused at step 3, it will go in a pause state because it still has to complete its execution. So let me do a pause sign over here and it is paused at step 3 again.


[User] Please transcribe this text

[Assistant] And now this third print preorder with the argument of n4 will again start from the very beginning. So, I hope you are understanding how the recursion is progressing. Let's continue further and you'll understand even more.


[User] Please transcribe this text

[Assistant] Now for the third print preorder, r is equal to n4. Again r is not equal to null, so this step will be skipped.


[User] Please transcribe this text

[Assistant] So step number one is done, step number two says print R of value.


[User] Please transcribe this text

[Assistant] Right now r is n4, n4 is a value of 10. So let's print that. I'll write 10 over here.


[User] Please transcribe this text

[Assistant] But this time if you see, r of left is nothing.


[User] Please transcribe this text

[Assistant] In the n4 node, on the left and right, we don't have anything because we do not have any children. So, these two values will be nothing but null. Programmatically, they will have the value of null. All the children will have the value of null. Correct? So,


[User] Please transcribe this text

[Assistant] This time r of left is nothing but null. So we are passing null and we are giving one more recursive call to print preorder. So let's see that call.


[User] Please transcribe this text

[Assistant] But this time we passed null in it. So of course third print preorder got paused at step three, right? So we have to do the pause symbol.


[User] Please transcribe this text

[Assistant] So third function got paused again at step 3, let's write 3 over here. And we are at fourth print preorder call wherein we have passed null.


[User] Please transcribe this text

[Assistant] So again we will start from the scratch that is start from the very first step for the fourth call. Now when you are passing null, this R is now become null, right?


[User] Please transcribe this text

[Assistant] So at step number one we are checking if r equal equal to null and this time this if condition becomes true. So we say if r equal equal to null then return.


[User] Please transcribe this text

[Assistant] And when I say return you will completely exit from this function and go back to the function that called you. So, fourth function that is fourth print preorder was called by third print preorder. So, when I say return the fourth function


[User] Please transcribe this text

[Assistant] Will return back, so it will complete its execution and it will return back to third print preorder. So now you can see the call function is going back to the calling function.


[User] Please transcribe this text

[Assistant] So once you come back from fourth print preorder back to the third print preorder, this was in a pause state, now it will go in a continue state. It was paused at step number three, step number three is done. So now we will continue.


[User] Please transcribe this text

[Assistant] We will continue with the fourth step. Now if you observe the fourth step is nothing but another print preorder call, another recursive call, but this time we are saying R of write.


[User] Please transcribe this text

[Assistant] So R is currently having N4, which is this node.


[User] Please transcribe this text

[Assistant] R of right is nothing but null because we don't have a right child.


[User] Please transcribe this text

[Assistant] So you can see a fifth preorder call, but this time again we will pass null in it.


[User] Please transcribe this text

[Assistant] So from third print preorder call, we are giving a fifth print preorder call, we are passing null. Okay. So again, third print preorder will go in a pause state, correct?


[User] Please transcribe this text

[Assistant] So let's write pause sign over here, but this time it is paused at step four, that is the last step. So after this last step, it will complete its execution. But first we will have to execute this fifth recursive call that is this fifth print preorder call and we'll have to do it from the start.


[User] Please transcribe this text

[Assistant] Okay, so let's execute this fifth print preorder call with the argument as null. So r is nothing but null.


[User] Please transcribe this text

[Assistant] Which means that we will directly return from 5th print preorder to the calling function which is the 3rd one. So 3rd print preorder you can see has called 5th. So we will go back from 5th print preorder back to 3rd print preorder.


[User] Please transcribe this text

[Assistant] And since this was paused, now this will resume because it has completed step 4. And once it has completed step 4,


[User] Please transcribe this text

[Assistant] Basically, you are coming at the end of the function. You have only four steps and this third print preorder has now completed all the four steps. So again, this will also complete its execution and it will go back to its calling function.


[User] Please transcribe this text

[Assistant] Who called the third print preorder? It was second print preorder. Now you can see over here the second print preorder is paused at step number three. So when this third print preorder completes its execution, it will go back to


[User] Please transcribe this text

[Assistant] The second print preorder with the R of N2. There is the node as N2. Alright. So now this print preorder was paused at step 3. So now it will again resume and start with step 4. It was paused over here. It will go back to step 4. So it will continue its execution and step 4 itself is a recursive call. You can see we are saying print preorder R of right. So when you come to


[User] Please transcribe this text

[Assistant] What is there to the right of N2? We have hash 26. Hash 26 is nothing but the address of N5. So we're gonna pass N5 over here. So now, second print preorder function is calling a sixth print preorder.


[User] Please transcribe this text

[Assistant] So this is the sixth print preorder called by second print preorder and this time we are passing n5 which is right child of n2. Okay, so again the second print preorder will go in a pause state and this time it will be paused at step 4.


[User] Please transcribe this text

[Assistant] So let's write the pause sign and it is paused at step 4, which is the last step. So it is paused over here because it is given a recursive call.


[User] Please transcribe this text

[Assistant] So we have to resolve this recursive call first, which is print preorder N5. Alright, so let's start the execution of this sixth print preorder.


[User] Please transcribe this text

[Assistant] So when you start with the execution, r is nothing but n5. We are passing n5 as the argument. We check if r equal equal to null, then return. But r is not equal to null. r is pointing to n5. So this step will not be executed. We will go to step 2. So at step 2, we are saying print r of value.


[User] Please transcribe this text

[Assistant] R is N5. We just said we passed N5. N5 has a value of 25, so 25 will be printed. Let's write 25 over here. So step 2 is done. Now we go to step 3.


[User] Please transcribe this text

[Assistant] So now we're giving another recursive call using R of left.


[User] Please transcribe this text

[Assistant] R is nothing but N5. So this is N5. What is there to the left? We have null. What is there to the right? We have null. So let's see the seventh print preorder call.


[User] Please transcribe this text

[Assistant] So 6th print preorder gave a call to 7th print preorder and we've passed null in it. Which means that the 6th print preorder is paused at step 3. Right? So this goes in a pause state at step 3.


[User] Please transcribe this text

[Assistant] For 7th print preorder, we are passing null, which means at the very first step, it is gonna return and it will come back.


[User] Please transcribe this text

[Assistant] To its calling function which is step 6, which is function 6. Now 6th print preorder will again resume its execution. It's completed step 3. So it will go to step 4. So step 4 is again print preorder R of write. So R over here is N5.


[User] Please transcribe this text

[Assistant] And R of right is nothing but null. You can see there is nothing there to the right child of n5. So one more print preorder call is given and we are passing null in it. So let's see that call. So you can see eighth print preorder call is given from sixth print preorder. So again, it goes in a pause state. So I'll pause this function. It paused at step four. When you pass null in the eighth print preorder,


[User] Please transcribe this text

[Assistant] And now it will come back from 8th print preorder back to 6th print preorder.


[User] Please transcribe this text

[Assistant] 6th print preorder will resume its execution. It was paused at step 4. It will resume from over here, but there is nothing else. That is there are no further statements inside it. Which means that the 6th print preorder is done its execution. So now it will complete and go back to the calling function.


[User] Please transcribe this text

[Assistant] Second print preorder. So it will go back to second print preorder.


[User] Please transcribe this text

[Assistant] Second print preorder, you can see I have written 4, which means it was paused at step number 4. So, when you resume the second print preorder, it has paused at the last statement. So, once it is done, even this second print preorder N2,


[User] Please transcribe this text

[Assistant] We'll complete its execution because it was paused at step four and there is nothing further to it to execute. So that function is done. So it will also return back to its calling function and who had called second print preorder. It was the very first print preorder call. So you'll go back over here. When you come from second print preorder to first print preorder, the first print preorder was paused at step three, right? You can see I've written step three over here. So now it will resume its execution.


[User] Please transcribe this text

[Assistant] And move to step 4. So when you move to step 4, for this first print preorder function, we have


[User] Please transcribe this text

[Assistant] Who's there to the right of n1 you can see we have a address hash 99 and it is the address of n3 you can see. So basically now we are


[User] Please transcribe this text

[Assistant] Again calling a recursive call to print preorder and we are passing n3. So now a ninth print preorder will be called because this was the eighth.


[User] Please transcribe this text

[Assistant] So ninth print preorder will be called from the first print preorder you can see. So this is how we are calling.


[User] Please transcribe this text

[Assistant] The ninth print preorder from the first print preorder. So again, first print preorder will go in a pause state and this time it will go in a pause state at step four, right? So let me write four over here and let's do a pause symbol.


[User] Please transcribe this text

[Assistant] Now we are calling 9th print preorder. We'll have to do it from the start. Correct? Let's.


[User] Please transcribe this text

[Assistant] Run this ninth print preorder from the start with the r value that is the node as n3. Okay, so r is now n3. This is the call. Step number one.


[User] Please transcribe this text

[Assistant] If r equal equals to null, r is n3, so r is not null, so this will not be executed.


[User] Please transcribe this text

[Assistant] Step 2, print the R value. R is N3, what is the value inside N3? It is 45, so let's print that. I'm gonna write 45 over here. So step number 2 is done. Now we move on to step 3. Alright.


[User] Please transcribe this text

[Assistant] So step 3 is another recursive call, we say print preorder R of left. R is currently N3.


[User] Please transcribe this text

[Assistant] What is there to the left of entry? We don't have anything. We have blank null value. So now we're gonna pass null. And now we're gonna give the tenth function call. So let's see that. So nine, that is the ninth preorder will give a recursive call to tenth print preorder and we're gonna pass null.


[User] Please transcribe this text

[Assistant] So of course when you pass null, the very first step inside this 10th recursive call is if r equal equal to null then return. So we'll directly return from 10 back to 9. So 9 was paused at step 3 and it called 10. 10 executed completely and came back to 9. So now we will move to step 4 for the 9th preorder. So for the 9th preorder function, step 4 is another recursive call, but this time we are saying r of right.


[User] Please transcribe this text

[Assistant] Who's there to the right of N3? It is hash 83 which is the address of N6. So now over here we are passing N6.


[User] Please transcribe this text

[Assistant] So now 11th function of print preorder will be called, where we are passing N6. So 9th preorder gave a call to


[User] Please transcribe this text

[Assistant] 11th print preorder with the node value of n6.


[User] Please transcribe this text

[Assistant] Right? Because this is where you pass the N6. That is the second recursive call. So let's do the pause symbol. 9th print reorder is paused at step number 4.


[User] Please transcribe this text

[Assistant] And it is now called 11th print preorder N6. So let's execute 11th print preorder first.


[User] Please transcribe this text

[Assistant] Alright, so over here R is N6 for the 11th print preorder.


[User] Please transcribe this text

[Assistant] We will say is R equal equal to null? No. R is not null, R is pointing to N6.


[User] Please transcribe this text

[Assistant] So we'll go to step 2. We'll say print r of value. What is the value inside the node n6? It is 65. So let's print 65. So I'm gonna write 65 over here. And step 2 is done. Now move to step 3.


[User] Please transcribe this text

[Assistant] Now step 3, we say print preorder R of left. R is currently N6. Who's there to the left? It is blank. Who's there to the right? It is blank.


[User] Please transcribe this text

[Assistant] So first, we'll pass null over here. We will call a 12th print preorder.


[User] Please transcribe this text

[Assistant] So 11th print preorder gave a call to 12th print preorder with the value of null. So this is what we passed over here, null. As soon as we pass null,


[User] Please transcribe this text

[Assistant] And start executing this 12th print preorder. The very first statement in that would be r="null", then return. So, we'll directly return from 12 to 11.


[User] Please transcribe this text

[Assistant] And as soon as the 12th function returned back to 11th function, it will again start its execution and it will move to step four. In step four, we will give print preorder R of right. Who's there to the right of N6? We have again null. So again, null will be passed and the 13th print preorder will be called from 11th print preorder. And this time again, we are passing null and this 11th print preorder will be paused at step four. It is going in a pause state at step four.


[User] Please transcribe this text

[Assistant] At the very first step itself, we are saying r equal equal to null, then return. So obviously,


[User] Please transcribe this text

[Assistant] 13th print preorder will return back to its calling function. And who called 13? It was 11th print preorder, so we came back. So now, this will not be paused.


[User] Please transcribe this text

[Assistant] It was paused at step 4, right? So after step 4, we don't have anything, which means 11th print preorder has completed its execution. It will go back to its calling function. Who called 11th print preorder? It was print preorder 9. You can see the arrow. Even 9th print preorder was paused at step 4.


[User] Please transcribe this text

[Assistant] So when 11th print preorder will go back to 9th print preorder, it will continue its execution from step 4. So from step 4, there is nothing else to go, which means even 9th print preorder has completed its execution, which means it will go back to its calling function.


[User] Please transcribe this text

[Assistant] So it will go back to the first print preorder. And first print preorder was paused at step 4. So it will resume its execution.


[User] Please transcribe this text

[Assistant] But after step 4, there is nothing to execute, which means even this will be done with its execution. And now, if you observe the output, we have basically traversed the entire tree and printed all its values in pre-order format.


[User] Please transcribe this text

[Assistant] So this is the entire pre-order tree traversal technique with the use of recursion.


[User] Please transcribe this text

[Assistant] And I hope with the use of diagrams with the arrows and the step by step traversal, you've got a good understanding of how the recursion progresses and how it comes back and how we get the output. Now if you use these plain simple English steps, apply it on the same binary counterpart.


[User] Please transcribe this text

[Assistant] And apply it on the same binary search tree, you'll obviously get the same output. We've discussed how you do that other part.


[User] Please transcribe this text

[Assistant] We've already discussed how to use these steps in the previous tutorial. So keep this output in mind.


[User] Please transcribe this text

[Assistant] And now we will go to the C++ coding part. So let's jump to the practical part and convert this pseudo code into proper C++ code. Just keep this output in mind so that we can cross check it with our C++ code.


[User] Please transcribe this text

[Assistant] Because we'll enter the same values for our binary search tree. Okay? Alright. Let's switch to our DaveC++ IDE.


[User] Please transcribe this text

[Assistant] Okay, so as you can see on the screen, we have already typed in some code. That is because this is the continuation.


[User] Please transcribe this text

[Assistant] On the binary search implementation code that we've started and we've already done with the insertion. So if I scroll down in our class BST, we have the insert node code completely done.


[User] Please transcribe this text

[Assistant] And we also had a print2d function which was there just to print out the tree. I will explain this code later on. But right now the topic is printing the tree in the preorder way. Right? So here we will create one more function printPreOrder.


[User] Please transcribe this text

[Assistant] So what I'll do is I'll directly paste the code over here and we'll go line by line. We only have like four instructions. So it's gonna be basic. It's just recursion. And on the right hand side, you can see the pseudo code as well.


[User] Please transcribe this text

[Assistant] So yeaah, this is the only code for printing in preorder. You basically take the address of the node.


[User] Please transcribe this text

[Assistant] The first step is if r equal equal to null, we say return. So that's step number one in the pseudocode.


[User] Please transcribe this text

[Assistant] This is the second step where you print the value inside that node. So that's the step number two in the pseudocode. So we say first print the data of the node.


[User] Please transcribe this text

[Assistant] And then this step is print preorder R of left. So this is a recursive call to the left side of the tree. And then this is a recursive call to the right side of the tree.


[User] Please transcribe this text

[Assistant] If you are a beginner, I highly recommend that you type this code at least once. I will be sharing this entire code of the entire implementation of binary search tree with you guys on our official website.


[User] Please transcribe this text

[Assistant] So the link to the entire code will be there in the description. You can check that out. But as I mentioned, just type it out once at least. And yeah, this is the function which is there inside our class. So scrolling down into our main function.


[User] Please transcribe this text

[Assistant] This is where we are printing it, right? So I'll just copy this.


[User] Please transcribe this text

[Assistant] Because we have to pass one node over here and we have to pass the address basically. Alright. So let's save this.


[User] Please transcribe this text

[Assistant] And the rest of the code I've already explained in the implementation when we started off with the implementation of binary search tree. So if you want to know what exactly we are doing, we're creating a menu driven program which takes in node values and inserts it. And this is a binary search tree implementation.


[User] Please transcribe this text

[Assistant] So after insertion, of course, we want to see what we've inserted, right? So that's where the printing comes. So this 2D printing is for visual printing and I'll explain that function later on.


[User] Please transcribe this text

[Assistant] But the printing preorder is where we traverse and print in a preorder way. We want to observe the values inside print preorder. So let's save this. Let's go to execute compile and run and let's see if our printing works fine. Okay, so our code is running fine, which means there are no syntax errors.


[User] Please transcribe this text

[Assistant] Now, what we will do is, we will use the same values that we debugged into our BST, into our digital blackboard. So I hope you remember those values. So first I'm gonna say option 1 to insert.


[User] Please transcribe this text

[Assistant] So the first root node value was 30. I'm gonna hit enter. You can see value inserted. Now the insertion code we've already discussed in previous tutorials.


[User] Please transcribe this text

[Assistant] So if you want to know that, you can check out this playlist and see the insertion code for binary search tree. Again, we will say insert. Let's insert the left node. It is 18. Hit enter. Again, value inserted to the left.


[User] Please transcribe this text

[Assistant] Again it is saying what operation do you want to perform, you want to insert more. Hit enter. This time it is 45 for the right child. Hit enter, you can see value inserted to the right over here.


[User] Please transcribe this text

[Assistant] And again it is asking whether what operation do you want to perform. Again we want to insert. Now we want to insert 10. So value inserted to the left. Again we want to do the insert. We want to insert 25. So value inserted to the right. Again we want to do insert. And one last thing is left is we want to insert 65.


[User] Please transcribe this text

[Assistant] Okay, so this is the binary search tree that we just dry run our entire pseudocode on.


[User] Please transcribe this text

[Assistant] And to see that now we have to call the print BST value function which is option 4. So when I hit option 4, basically what is gonna happen, the print2d function will be called wherein the entire tree will look in a 2d way and then our print preorder function will also be called.


[User] Please transcribe this text

[Assistant] So we can verify the values if they are printing in proper pre-order way only. So let's see. Hit option 4 and hit enter.


[User] Please transcribe this text

[Assistant] And there you go, this is our tree. It is, you know, rotated 90 degrees.


[User] Please transcribe this text

[Assistant] In anticlockwise direction, but that is the best representation on a command prompt.


[User] Please transcribe this text

[Assistant] So this is the exact tree that we just saw on our digital blackboard also. But more than that, this print preorder number is what is more important.


[User] Please transcribe this text

[Assistant] You can see the values printed as follows, 30, 18, 10, 25, 45, 65. And then of course again the menu driven program is running.


[User] Please transcribe this text

[Assistant] You can see that we are getting this same output, so 30, 18, 10, 30, 18, 10, 25, 45, 65, 25, 45, 65. So this means our program is working perfectly fine and we have successfully implemented


[User] Please transcribe this text

[Assistant] The pre-order tree traversal technique, which is a depth-first technique, that is DFS technique.


[User] Please transcribe this text

[Assistant] Pre-ordered tree traversal with the pseudo code with the C++ program with the full implementation as well as the working diagram and visual representation.


[User] Please transcribe this text

[Assistant] Okay, so I hope you've got a good idea of this tree traversal technique.


[User] Please transcribe this text

[Assistant] If you understood this entire video, this entire technique, please give this video a like. Let me know in the comments how this video was. Do share it with your friends. And I'll see you guys in the next one. Peace!


[User] Please transcribe this text

[Assistant] This way. So we'll walk through to the tasting bar.


[User] Please transcribe this text

[Assistant] Our menu is quite rare, so to make a special cuvee just from that grape is very, very unique and difficult to find.


[User] Please transcribe this text

[Assistant] But, uh, Blanc de Blanc is Chardonnay, so one pure variety.


[User] Please transcribe this text

[Assistant] And so what we want to do is using the pressure from the gas and the fermentation.


[User] Please transcribe this text

[Assistant] That yeast and keep as much of the wine as we can. So just like that.


[User] Please transcribe this text

[Assistant] Tomato Team was truly naive to think that they wouldn't need to bring much cash on their trip.


[User] Please transcribe this text

[Assistant] After all, you can buy almost anything with the swipe of a card these days.


[User] Please transcribe this text

[Assistant] Then when faced with a cash-only situation, they finally realize that their cards and RMB were rendered completely useless.


[User] Please transcribe this text

[Assistant] See, if you don't want to beg in the streets while abroad, then you'd best learn this hard skill. How to exchange money.


[User] Please transcribe this text

[Assistant] Kevin, it looks like you've just gotten into a tricky situation. You want to exchange a $100 bill for every single other denomination? I'll bet you can't.


[User] Please transcribe this text

[Assistant] Just for the coins, you'll need the penny, nickel, diamond quarter. As for notes, you'll need the one dollar, five dollar, ten dollar, twenty dollar, fifty dollar. You'll be really lucky to find a fifty dollar bill.


[User] Please transcribe this text

[Assistant] Go on now, Kevin. Failure awaits you at every corner. Excuse me, man.


[User] Please transcribe this text

[Assistant] Alright, so grammarians, I want to talk to you about the difference between subject and object pronouns, but before we do that, let's start off with a little primer on what subjects and objects actually are, uhm, just generally for our grammatical purposes. So in grammar,


[User] Please transcribe this text

[Assistant] The subject is the part of the sentence or clause that does a thing. The subject does a thing.


[User] Please transcribe this text

[Assistant] The object on the other hand is the thing that is acted on, has stuff done to it. So the object has stuff done to it.


[User] Please transcribe this text

[Assistant] So, the subject acts, the object is acted upon. Let's give an example. So, in the sentence,


[User] Please transcribe this text

[Assistant] The subject of the sentence, the doer of the thing is Reyna. Reyna is the subject. The thing she is doing is writing an email. So Reyna wrote an email. Email is the object.


[User] Please transcribe this text

[Assistant] Uh, now there are cases when a sentence doesn't have an object. For example, we could just say, Raina wrote. Doesn't have an object, it's just Raina's the subject.


[User] Please transcribe this text

[Assistant] And then there is no object. This is what we call intransitive usage, but you don't need to write that down or anything. Now.


[User] Please transcribe this text

[Assistant] Understanding the relationship between email and Reina.


[User] Please transcribe this text

[Assistant] Enables you to understand how subject and object pronouns are used. So when we're subbing out these nouns for pronouns,


[User] Please transcribe this text

[Assistant] We can figure out which ones we have to use because pronouns have different forms depending on whether or not they are subjects or objects.


[User] Please transcribe this text

[Assistant] Uh, so Reina is a girl's name, and if we know that Reina is a girl, we can refer to her as either she or her. These are two of the feminine pronouns.


[User] Please transcribe this text

[Assistant] Uh, one of these is a subject, and one of them is an object. She is the subject form, and her is the object form. So, if we wanted to rewrite this sentence, speaking of Reina, we would say,


[User] Please transcribe this text

[Assistant] Her is the object pronoun.


[User] Please transcribe this text

[Assistant] And therefore is the thing that had, is the ob, the object pronoun has stuff done to it, as opposed to the doer of things. She is the subject form, it's the doer. For email it's easy, this just becomes it in all cases. The subject form and the object form are the same.


[User] Please transcribe this text

[Assistant] Let's do a couple more examples just to shore this up so you see what I mean.


[User] Please transcribe this text

[Assistant] Right now, I is the subject, her is the object, subject, object. But what if we switched it? What would it look like then?


[User] Please transcribe this text

[Assistant] Well, it wouldn't be her give I a present, because since we're switching the subject and the object, uhm, we're gonna be switching the pronouns that we use too. So it would be, she gave me a present.


[User] Please transcribe this text

[Assistant] And me is the subject, is the object form, excuse me. Me is the object form of I.


[User] Please transcribe this text

[Assistant] Same thing with, uh, they and he. So, they showed.


[User] Please transcribe this text

[Assistant] So now, we do the switcheroo, him becomes he.


[User] Please transcribe this text

[Assistant] So we go from the object form, which is him, to the subject form, which is he.


[User] Please transcribe this text

[Assistant] And then they, the subject form becomes them, the object form.


[User] Please transcribe this text

[Assistant] Now when it comes to you and it, you're in luck.


[User] Please transcribe this text

[Assistant] Because the, uh, the subject and object forms of these are the same. So subject equals object.


[User] Please transcribe this text

[Assistant] With you and it. So I could say, you give it a present, just as easily as I could say, it gives you a present. Oh, I didn't realize I changed this to the past tense. She gives me a present. There we go, that's better. And that's the difference between a subject and an object pronoun. You can learn anything. David out.


[User] Please transcribe this text

[Assistant] Starting from Hainan Island, the southernmost province of China.


[User] Please transcribe this text

[Assistant] You can reach Sunshine City in the southern tip by this transportation supply ship.


[User] Please transcribe this text

[Assistant] The sea is colorful, with an average visibility of more than 30 meters.


[User] Please transcribe this text

[Assistant] The islands in front of us do not seem to be connected with each other.


[User] Please transcribe this text

[Assistant] But they are known as the seven connected islets.


[User] Please transcribe this text

[Assistant] That's because beneath the sea, there is a huge reef holding them together.


[User] Please transcribe this text

[Assistant] As the tide rises and falls, they display a variety of features.


[User] Please transcribe this text

[Assistant] Most of the eyelets here are made up of coral remains.


[User] Please transcribe this text

[Assistant] Coral secretes limestone, which becomes their living shells.


[User] Please transcribe this text

[Assistant] Layer upon layer of limestone is added and then compacted to form the coral reef we see today.


[User] Please transcribe this text

[Assistant] At the end of the glaciers beneath the main peak of a mountain area in southwestern China,


[User] Please transcribe this text

[Assistant] The surface of the rocks here is an eye catching bright red.


[User] Please transcribe this text

[Assistant] This is the heart of the Hengduan Mountains, a mountainous region in southwestern China.


[User] Please transcribe this text

[Assistant] 145 snowy peaks over 5000 meters above sea level are clustered here, forming an amazing group of mountains.


[User] Please transcribe this text

[Assistant] The highest peak, Gungah Mountain, is 7,556 meters above sea level.


[User] Please transcribe this text

[Assistant] It is the highest point in the mountainous area of southwest China.


[User] Please transcribe this text

[Assistant] Its giant conical peak is the cradle of glacier formation, from which 74 mature glaciers extend in all directions.


[User] Please transcribe this text

[Assistant] The Hylor Go glacier in the east has a huge icy waterfall measuring 1,100 meters wide with a drop of more than 1,000 meters.


[User] Please transcribe this text

[Assistant] The strong thawing effect leads to frequent massive icy avalanches.


[User] Please transcribe this text

[Assistant] Giant glaciers descend all the way into dense forests.


[User] Please transcribe this text

[Assistant] It is the lowest maritime glacier in Asia.


[User] Please transcribe this text

[Assistant] Bright red rocks can be seen almost everywhere in the valley at the end of the glacier.


[User] Please transcribe this text

[Assistant] Scientists have found that the red blood colour on the stone is not from a mineral.


[User] Please transcribe this text

[Assistant] But a rare parasite. A rare lichen complex.


[User] Please transcribe this text

[Assistant] Whenever the temperature and humidity are right, they spread across the rock surface, dyeing the rocks bright red.


[User] Please transcribe this text

[Assistant] Taken away from the mountains, however, they quickly change colour and dye.


[User] Please transcribe this text

[Assistant] Even if they are left in peace, their lifespan is only four to five years. And then they will regenerate and begin coloring the rocks bright red again.


[User] Please transcribe this text

[Assistant] Why they came into being has baffled many great minds.


[User] Please transcribe this text

[Assistant] So we've got these three penguins, grammarians. We've got Raul, who you may remember from his sweet mohawk. We've got Cesar. And we've got Gabriella.


[User] Please transcribe this text

[Assistant] Scissor is a medium amount of happy.


[User] Please transcribe this text

[Assistant] Uh, Raul is more happy, and Gabriella is the most happy. And in English, we have a way to compare these. You know, to compare Raul to Cesar, or to compare Raul to Gabriella, or any combination


[User] Please transcribe this text

[Assistant] Thereof. And we call this comparative and superlative adjectives. And before I get too into the weeds on that, let me, let me just show you what that looks like. So, okay, so we can say, Raul. Let me put in the...


[User] Please transcribe this text

[Assistant] He's got all the fish he wants. Life is good. Raul.


[User] Please transcribe this text

[Assistant] This is what we call a comparative because we're comparing Raul to Cesar and we're comparing their happiness levels and Raul has more happiness in him than Cesar does. Poor Cesar. However, Gabriela


[User] Please transcribe this text

[Assistant] The happiest is something that we call superlative, uh, in English. So it's not, it's not just a...


[User] Please transcribe this text

[Assistant] It's not just a comp- it's not just a comparison, right? It's not Raul is happier than Cesar. Gabrielle is happier than all the other penguins. She is the happiest. She is the happiest. She's the most happy.


[User] Please transcribe this text

[Assistant] So one way to think about this is that Raoul's happiness is slightly larger than Cesar's happiness.


[User] Please transcribe this text

[Assistant] Unbeatably more than both of them. I'm gonna use a made up math symbol. Boop, boop, boop. Like super greater than. Uhm, un, you know, undisputed. She is the happiest penguin.


[User] Please transcribe this text

[Assistant] The comparative equals more, and the superlative equals most.


[User] Please transcribe this text

[Assistant] So this is slightly more, this is super much more.


[User] Please transcribe this text

[Assistant] And something that's neat about English is you can use the comparative and the superlative for both positive relationships and also negative relationships. So we could say Raul is a happy penguin. And we could say Raul is happier than Cesar. We can also say Cesar is


[User] Please transcribe this text

[Assistant] So this is, this is comparative, but it's going the other way. Right? Cesar is less happy than Raul, so then we'd use the less than symbol.


[User] Please transcribe this text

[Assistant] Gabriella is the happiest penguin, and so for this group of three, Cesar is the least happy.


[User] Please transcribe this text

[Assistant] So you can use the comparative and the superlative forms of adjectives to compare relationships where one thing is more or most than another or others or relationships where one thing is less or least than others.


[User] Please transcribe this text

[Assistant] That's how the comparative and superlative work. But if you stick around for the next video, I'm gonna talk about how to figure out


[User] Please transcribe this text

[Assistant] How to form the comparative and superlative, uh, when you're looking at a word you've never seen before. Like, uh, what if we made up a word, like, mmm, like, belarfy.


[User] Please transcribe this text

[Assistant] What do you do with that? Well, you'll find out next time. Uh, in the meantime, you can learn anything. David out.


[User] Please transcribe this text

[Assistant] Uhm, yeaah, so there's actually a couple of tests that you can do on these sentences to see if you need a comma between the adjectives or not.


[User] Please transcribe this text

[Assistant] There's this sort of hierarchy or like order that you put adjectives in when you have multiple of them in a sentence and it is called dosa scomp.


[User] Please transcribe this text

[Assistant] Right, so like in the second sentence, mushy is an opinion, like you said, and green is a color. And in dosiscomp, opinion comes before color. So that's the order that you write them in.


[User] Please transcribe this text

[Assistant] So like in the first sentence, when you have mushy and sticky, which are both opinion adjectives, these are called coordinate adjectives. They're in the same category of doses comp.


[User] Please transcribe this text

[Assistant] And if you wanted to, you could reverse the order. You could say sticky mushy apple.


[User] Please transcribe this text

[Assistant] Right, and that's like changing it from mushy sticky to sticky mushy.


[User] Please transcribe this text

[Assistant] If you can reverse the order of the adjectives, and you can put and in between the two of them, then they're coordinate adjectives.


[User] Please transcribe this text

[Assistant] And that's why in the case of the second sentence with mushy green apple, you don't put a comma between them. They're in different categories in dosa scomp, and so they must stay in that order, and there's no need for a comma.


[User] Please transcribe this text

[Assistant] The Dream Arena is packed with over 1200 people at this point in time. We have about 80 to 90 people sitting in front of us right now.


[User] Please transcribe this text

[Assistant] There's a 100% chance Alliance definitely underestimated them with one, the way they picked, two, the way they played, and three, their attitude before the game. Like before they played that match, they were telling us, you know, like, they're gonna beat Kaboom, so like, we better beat Hazard for the three-way tag, cause they wanna fight us again and things like that, you know?


[User] Please transcribe this text

[Assistant] Karma right there from like, looking down on them, you know? And I thought that was pretty great.


[User] Please transcribe this text

[Assistant] Hi everyone, it's Jesse and I'm back with part three of the Fix It Mom. Right? In this story, Toby is having a bad day.


[User] Please transcribe this text

[Assistant] Everything breaks! Right? The door handle broke, his bicycle broke, the faucet broke, the chair broke. So many things are breaking. Poor Toby. Ugh. Welp.


[User] Please transcribe this text

[Assistant] What's going to break this time? Let's look. What does Toby have?


[User] Please transcribe this text

[Assistant] Picture, right? Oh yes, wow, look at that. There's the picture. And the picture frame goes on the outside, right? Oh, very nice. And you can hang a picture frame on the wall. Whoop! Like that. That is a picture frame. F-R-A-M-E. Toby has a picture frame.


[User] Please transcribe this text

[Assistant] What will break? Hmm, take a look. Oh no. Look at that. It's broken! Again. Poor Toby. 불상한 Toby. Poor Toby. Let's read.


[User] Please transcribe this text

[Assistant] Hobie went to hang a picture on the wall, but the hook fell out.


[User] Please transcribe this text

[Assistant] Toby went to hang a picture on the wall.


[User] Please transcribe this text

[Assistant] The picture fell down, Toby cried.


[User] Please transcribe this text

[Assistant] Everything is breaking today. Remember, the door handle broke, the chair broke, the bicycle broke, the faucet broke. So many things are breaking today. Everything. Now, the hook broke too.


[User] Please transcribe this text

[Assistant] And here comes the fix-it mon! Doot doot doo!


[User] Please transcribe this text

[Assistant] There is mom, and what tool does she have this time? Take a look.


[User] Please transcribe this text

[Assistant] Not a screwdriver, not a wrench, not pliers, not glue. What is it? This is called a hammer. Right. A hammer. With a hammer, you can take a nail. This is called a nail. Okay? Screw anirang. Nail. Right? You take the hammer and go.


[User] Please transcribe this text

[Assistant] Bang, bang, bang, bang, bang. And you can hammer the nail with a hammer. But, there's a problem. What happened? 어떻게 됐어요? 엄마, 엄지가 엄지손가락이 아파요. Right? Look at this. Look at mom's face. Mom is... She's not happy. 행복하지 않아요. Right? 아파요.


[User] Please transcribe this text

[Assistant] Let's check.


[User] Please transcribe this text

[Assistant] I can fix it, mom said. She looked where?


[User] Please transcribe this text

[Assistant] Very good, in the toolbox. She found a hammer. Aha, this is called a hammer.


[User] Please transcribe this text

[Assistant] Mom went bang, bang, bang with the hammer. Ouch!


[User] Please transcribe this text

[Assistant] Very good. Mom, pssh, hit her thumb. How did mom hit her thumb?


[User] Please transcribe this text

[Assistant] With the hammer. That must hurt. What will Toby do? Toby will help his mom. Let's see.


[User] Please transcribe this text

[Assistant] Ahaa, see, he did help his mom. Look, now on mom's finger, there is what? Bende? Bendeji? Hmm, we can say band-aid. Band-aid, excellent. Right, see here, there is a box. What's in the box? Band-aids. Toby helped his mom.


[User] Please transcribe this text

[Assistant] He looked in the toolbox. Toby looked in the toolbox.


[User] Please transcribe this text

[Assistant] But sometimes, I can help mom.


[User] Please transcribe this text

[Assistant] That was the fix it mom. Was it good?


[User] Please transcribe this text

[Assistant] Alright, that's the end of the Fix It Mom. I'll see you next time.


[User] Please transcribe this text

[Assistant] In the Hot 6 Summer Championship, SKT had dominated, securing a perfect record in the regional playoff group stage. Only dropping a single game heading into the Grand Finals. In their showdown with the KT Rolster Bullets, things did not go as smoothly.


[User] Please transcribe this text

[Assistant] The hard fought victory cemented SKT's status as Korea's top team and punched their first ever ticket to Worlds. And their rampage continued there.


[User] Please transcribe this text

[Assistant] Awaiting them there was Royal Club. Who's gonna win it?


[User] Please transcribe this text

[Assistant] Thank you, Monty. I appreciate you like your SKT favorite, but I think it's more time for a boy illusion.


[User] Please transcribe this text

[Assistant] Thanks for watching! If you want more great content, be sure to hit that subscribe button.


[User] Please transcribe this text

[Assistant] No need to get down on yourself. Sometimes things just don't turn out as planned. Even I can't guarantee useful intel every time I'm dispatched. You just have to keep at it and never give up.


[User] Please transcribe this text

[Assistant] In fact, I think she's out in the wilderness on patrol this morning. You should be able to find her around Storm Bear Mountains.


[User] Please transcribe this text

[Assistant] It's fine when you're just joking between us, but I'm afraid our honorary knight might misunderstand you.


[User] Please transcribe this text

[Assistant] I still have more recon to do in the wilderness. Well, until next time!


[User] Please transcribe this text

[Assistant] This lovely tomato. And above the tomato, we're gonna have, uh, something similar to Bingo's Starry Night. And what I just learned was...


[User] Please transcribe this text

[Assistant] Ah, you know, the word escapes me right now. Uh, what was it? Uhm, enfresco? Impasto.


[User] Please transcribe this text

[Assistant] Guys, you know what? After, after we finish this series, I quit. I'm not hosting anymore. I'm gonna be a professional artist from now on.


[User] Please transcribe this text

[Assistant] I mean, look at this, this terrible painting, you know, I mean, even after just seeing a few works of art today, learning about some very basic painting techniques, I think I was able to create, or at least


[User] Please transcribe this text

[Assistant] Slightly create an imitation of Van Gogh painting that anyone could do.


[User] Please transcribe this text

[Assistant] You know, even if you're not that great at painting, I think there's something therapeutic about it. It was, it was great. And no matter who you are, I think.


[User] Please transcribe this text

[Assistant] Hi kids, welcome back. Let's finish lesson 6. We're talking about soccer. We're talking about


[User] Please transcribe this text

[Assistant] A certain person who is on the soccer field. Who is that? We talked about two teams, right? You have to have two teams to play, but there's another person on the field and that person is called the referee. Referee. A referee is not a coach. The referee is not a teacher. The referee is like a judge.


[User] Please transcribe this text

[Assistant] They look and they say, it's okay or not okay. When people play a game, right, sometimes people make mistakes. The referee says, oh, that's a mistake or that's not fair, right?


[User] Please transcribe this text

[Assistant] When you play a sport or any game, you want to make sure that the game is fair, that it's okay. Okay, so the referee makes players follow the rules.


[User] Please transcribe this text

[Assistant] Follow the rules. Very important expression. You follow the rules when you play a game.


[User] Please transcribe this text

[Assistant] When you go to school, you follow the rules. No running. No hitting.


[User] Please transcribe this text

[Assistant] Okay, those are the rules. You should follow the rules. Follow the rules. Many games have different rules, like soccer. We talked about the rules of soccer. You can move the ball with your feet.


[User] Please transcribe this text

[Assistant] Only goalies can use their hands. Those are the rules. The referee makes players follow the rules.


[User] Please transcribe this text

[Assistant] The referee does not take sides. Take sides? What's that?


[User] Please transcribe this text

[Assistant] Think about that. One side, one team. The other side, the other team. The referee cannot, uh, say, oh, I like you guys. I'm going to help you.


[User] Please transcribe this text

[Assistant] There are two teams and a referee.


[User] Please transcribe this text

[Assistant] On the field. On the field. The soccer field. The game is on. The game is on. That's a good expression. The game is on means, let's play!


[User] Please transcribe this text

[Assistant] Let's do it. Let's play. The game is on. Because you have two teams and a referee on the field. They're ready to play. The game is on.


[User] Please transcribe this text

[Assistant] Okay, let's review what we've learned in Lesson 6.


[User] Please transcribe this text

[Assistant] We're going to talk about the people on the field, right? We said there are two teams and a referee on the field. The game is on, on the field. This is part of a soccer field. You can see the goal here, right? There's the goalie.


[User] Please transcribe this text

[Assistant] You can see the halfway line here. This is halfway. So this is half of the field.


[User] Please transcribe this text

[Assistant] What do we see go happening here? Over here, what do we see? We see a goalie. She's using her hands, right? She's gonna try to keep the ball from going into the goal. She's going to keep the other team


[User] Please transcribe this text

[Assistant] From scoring, she's going to stop the ball with her hands. A goalie tries to stop the ball. Stop the ball. And she is using her hands.


[User] Please transcribe this text

[Assistant] What's going on here? A forward tries to score goals. Remember I talked about different


[User] Please transcribe this text

[Assistant] Team members have different positions. We talked about goalie, right? Well this is another position, a forward. A forward. Where is a forward? A forward is in forward. They're in the front, right? They try to kick the ball into the goal.


[User] Please transcribe this text

[Assistant] And they score. Score a goal, score a point. Okay? So you can score a goal.


[User] Please transcribe this text

[Assistant] Score a point. Whoops, where'd it happen to my N? My N disappeared. Score a point. Or score a goal.


[User] Please transcribe this text

[Assistant] Guess what? Oh, where's my A? Okay. If you play basketball, boom, boom, boom, boom, right? You score, what do you score? You score a basket. Basket. You score a basket. Okay?


[User] Please transcribe this text

[Assistant] But it's all points, right? Every game, you score points. So, a forward tries to score goals or tries to score points. Okay? A defender, a defender tries to stop the other team from scoring. So the defender is helping the goalie.


[User] Please transcribe this text

[Assistant] The defender helps the goalie. But remember, the defender can't use his hands. He can't use his hands. Only the goalie can use her hands.


[User] Please transcribe this text

[Assistant] So a defender tries to stop the other team from, stop from scoring. They work together. They're on the same team, on the same team.


[User] Please transcribe this text

[Assistant] Here, a midfielder, a midfielder, passes the ball to a forward. So this person is on the same team as the forward. They're on the same team. A forward and a midfielder.


[User] Please transcribe this text

[Assistant] She passes the ball to the forward. The forward tries to kick it in the goal. These, the defender and the goalie, try to stop


[User] Please transcribe this text

[Assistant] Okay, so of course you have these positions on both teams, right? Of course you have a goalie over here and other defenders, and you have the forwards for, uh, the orange team here, okay? So you have these positions on both teams. Did I forget one person?


[User] Please transcribe this text

[Assistant] Him, a referee. Look at the referee. What's the referee doing?


[User] Please transcribe this text

[Assistant] Right? The referee is blowing a whistle because something happened. What happened?


[User] Please transcribe this text

[Assistant] Maybe somebody made a mistake. Okay, somebody did something. They didn't follow the rules. So the referee blows the whistle. A referee rules the game. Rules the game?


[User] Please transcribe this text

[Assistant] or make sure the players are following the rules. If somebody doesn't follow the rules the referee


[User] Please transcribe this text

[Assistant] There are many rules to playing soccer. But remember, if you play soccer, you have to run a lot. But it's not like running 100 city blocks. It's more fun because you're running back and forth and you're chasing a ball. So you don't think about running that far.


[User] Please transcribe this text

[Assistant] You really do run that far. So it's a good game. You make your body strong by running a lot. And it's a lot of fun to play on a team.


[User] Please transcribe this text

[Assistant] Okay, well that wraps up lesson 6. I hope you enjoyed learning about soccer. We'll see you next time. Take care.


[User] Please transcribe this text

[Assistant] The New Forest Path Written by Maribeth Bolts


[User] Please transcribe this text

[Assistant] We see brown birds by the path.


[User] Please transcribe this text

[Assistant] We see old leaves by the path.


[User] Please transcribe this text

[Assistant] We see new flowers by the path. We see our dog by the path.


[User] Please transcribe this text

[Assistant] In very what it meant was that someone would see something they like and they would...


[User] Please transcribe this text

[Assistant] That was the sort of general term. So that's how bespoke tailoring then sort of


[User] Please transcribe this text

[Assistant] Okay, so, uhm, normally, as I say, when you're here in London, uh, we like to get two to three fittings, ideally, because here in London it normally takes around about 10 to 12 weeks.


[User] Please transcribe this text

[Assistant] So, starting price, uh, for our suits, uh, for a two-piece suit starts at just under five thousand pounds. Pants and jacket. Yeah. Two-piece.


[User] Please transcribe this text

[Assistant] So and then for a three piece, so that's jacket, waistcoat, trousers. Yes. You're going to be looking at around about five and a half. Okay. And then it will just simply depend on the cloth that you're looking at.


[User] Please transcribe this text

[Assistant] Really what we end up doing today, uh, is a whole process. Right. Uhm, so from beginning, uh, from picking your particular cloth.


[User] Please transcribe this text

[Assistant] Uh, to styling it. So picking step one. Yup. So pick the cloth, then we style it, and then we pass you over to the cutters.


[User] Please transcribe this text

[Assistant] So this, this particular bunch here, uh, it's called a fresco. Okay. They are probably the best for travel.


[User] Please transcribe this text

[Assistant] Okay, so this is what I would call your good classic business suit. It's a nice 11 ounce weight. So it's going to be quite hardy. It's the sort of thing you would probably wear to the office. It's a little softer. It will wear quite nicely in this sort of weather.


[User] Please transcribe this text

[Assistant] So uhm, this is a single breasted two button notch lapel.


[User] Please transcribe this text

[Assistant] And then you've got, uh, the trousers. This is just a three piece suit. But this is a single breasted crosses over.


[User] Please transcribe this text

[Assistant] Uh, and then this time you've got, uhm, braces on tabs here to wear. Suspenders. We call them braces.


[User] Please transcribe this text

[Assistant] So these things are called braces? These are called braces, yea. Okay. See, suspenders for, uh, for the English will be something for holding up ladies stockings. Really? Yea.


[User] Please transcribe this text

[Assistant] You can have them so that they sort of come undone, so they're all sort of like working.


[User] Please transcribe this text

[Assistant] We will, uh, take your measurements. It's the sort of thing you would probably wear to the office.


[User] Please transcribe this text

[Assistant] Every spring, around mid-March, hundreds of thousands of birds arrive at the Jingxin wetland of northeast China's Jilin province. It turns this remote area into a fascinating paradise for these migrant birds.


[User] Please transcribe this text

[Assistant] The Jingxin Wetland is located on the border of China, Russia, and North Korea.


[User] Please transcribe this text

[Assistant] The diverse environment and humid climate make it an important stopover for migrating birds.


[User] Please transcribe this text

[Assistant] Seagulls are common here because it is very close to the sea of Japan.


[User] Please transcribe this text

[Assistant] Many large predatory birds such as golden eagles, white-tailed sea eagles, and stellar sea eagles are frequent visitors. They are rare and endangered species in the world and are listed as protected animals at a national level in China.


[User] Please transcribe this text

[Assistant] Among these species, the stellar sea eagles are especially rare, with only a few thousand remaining in the world.


[User] Please transcribe this text

[Assistant] Now, more and more rare birds such as Chinese mergansas and red-crowned cranes are being found in the Jingxin wetland, attracting hundreds of photographers.


[User] Please transcribe this text

[Assistant] So as not to disturb the birds, the photographers wait quietly in the specified location.


[User] Please transcribe this text

[Assistant] They wait patiently among the gathering of birds for the right moment to capture an amazing moment in nature.


[User] Please transcribe this text

[Assistant] Hey, grammarians. Today, let's start talking about subordinating conjunctions. Words like although and after and because.


[User] Please transcribe this text

[Assistant] This is a pretty complicated topic because in order to understand subordinating conjunctions, uh, you have to understand the difference between an independent and a dependent clause because that's what subordinating conjunctions do is they


[User] Please transcribe this text

[Assistant] They unite independent and dependent clauses. That's what subordinating conjunctions do. But what, what, what is, what is, what are these? You know, what is an independent and a dependent clause? Well, okay, so,


[User] Please transcribe this text

[Assistant] First of all, let's back up again. What is a clause? A clause is just a language chunk that has a subject and a verb. That's what a clause does.


[User] Please transcribe this text

[Assistant] All sentences are clauses but not all clauses are sentences. I'll write that down. So all sentences are clauses but not all clauses are sentences.


[User] Please transcribe this text

[Assistant] Extra information that isn't necessary to the understanding of the sentence, right?


[User] Please transcribe this text

[Assistant] But an independent clause has to be able to stand on its own.


[User] Please transcribe this text

[Assistant] So let's take a look at this sentence here. Herbert performed his irresponsible experiments because he was curious. And this sentence is composed of two clauses. In red, we've got this independent clause. Herbert performed his irresponsible experiments. And in green, we have this dependent clause because he was curious.


[User] Please transcribe this text

[Assistant] Now we know that because he was curious is the dependent clause because it, it, it explains more of why Herbert did what he did, right? It is explaining the reason for his performing irresponsible experiments.


[User] Please transcribe this text

[Assistant] Uh, but because he was curious on its own doesn't work as a sentence. He was curious, does.


[User] Please transcribe this text

[Assistant] That's a sentence, but because he was curious,


[User] Please transcribe this text

[Assistant] Asks more questions than it answers. Because he was curious what?


[User] Please transcribe this text

[Assistant] Yeaah? So what? Then it's probably a dependent clause. Let's write that down. Put that in a doctrine.


[User] Please transcribe this text

[Assistant] So, uh, a dependent clause should cause you to ask, yeaah, so what?


[User] Please transcribe this text

[Assistant] Because a dependent clause leans against an independent clause. It's like a ladder laid up against the tree. The tree is still gonna be standing there whether or not the ladder is there or not. But the ladder is useful because it allows you to get up further into the tree and explore its leaves, if that makes sense. It allows you to get further context and further understanding.


[User] Please transcribe this text

[Assistant] But the tree could just as easily, it's still a tree without the ladder, right? You don't have to have a ladder in order to be a tree.


[User] Please transcribe this text

[Assistant] Another thing about the difference between a coordinating and a subordinating conjunction is that coordinating conjunctions only unite independent clauses with each other.


[User] Please transcribe this text

[Assistant] Which means any sentence that has a coordinating conjunction like but or anything else in fanboys, which is for and nor but or yet so, right, uhm, can be separated into two sentences, two separate sentences. Look at this. So, Jimothy liked to wash the dishes, but Beckany preferred to sweep the floor.


[User] Please transcribe this text

[Assistant] Now these can each be their own sentences. Jim, if you like to wash the dishes, Beckany preferred to sweep the floor. We can combine these if we want to, and we have.


[User] Please transcribe this text

[Assistant] Whereas this subordinating injunction sentence that begins with although cannot be separated.


[User] Please transcribe this text

[Assistant] So Lady Penelope hated his pranks, that's a sentence. Although she loved Sir Reginald, that's not a sentence. This is a dependent clause. So this can be split.


[User] Please transcribe this text

[Assistant] This cannot be split, because although she loved Sir Reginald, doesn't stand on its own, it just grants additional context and detail to the fact that Lady Penelope hated Sir Reginald's pranks.


[User] Please transcribe this text

[Assistant] So with that in mind, here are some of the most common subordinating conjunctions in English. And some of these you might recognize as being adverbs or prepositions in other contexts, but you can also use them to unite dependent and independent clauses. So here we go.


[User] Please transcribe this text

[Assistant] All of these words have the power to unite independent and dependent clauses.


[User] Please transcribe this text

[Assistant] You may notice some of them, like after and before, are prepositions.


[User] Please transcribe this text

[Assistant] They can be used in many ways. English is complicated, but I am confident that you can figure this out because you can learn anything. These are some of the subordinating conjunctions of English. David out.


[User] Please transcribe this text

[Assistant] They range in size from about 20 square meters up to almost 100, and you'll bump into one every few hundred steps. In Hawaii, for most of your everyday purchases,


[User] Please transcribe this text

[Assistant] You'll need to head to the ABC stores to replenish. The selection here is very complete. Food, clothes, daily necessities, souvenirs. It's got anything and everything beyond doubt, a treasure trove of goodies. So, did we come here today purely for shopping?


[User] Please transcribe this text

[Assistant] What kind of animal has these stripes?


[User] Please transcribe this text

[Assistant] What kinds of animals have no stripes?


[User] Please transcribe this text

[Assistant] These animals have no stripes.


[User] Please transcribe this text

[Assistant] What other animals have no stripes?


[User] Please transcribe this text

[Assistant] Oh, it looks like we've arrived at a parking lot. Does this mean we're about to go somewhere? So, where are we going today?


[User] Please transcribe this text

[Assistant] UCSB refers to University of California Santa Barbara, one of the universities in the UC system. Look at that.


[User] Please transcribe this text

[Assistant] Now you have a better understanding of what study life is like in UCSB. If you wanna play hard, you have to study hard first.


[User] Please transcribe this text

[Assistant] We've already spent enough time here, so why don't we go take a look at some classrooms as well.


[User] Please transcribe this text

[Assistant] We're going to visit the most beautiful place on the entire campus. That charming beach that leads you right into the lap of the Pacific Ocean. This is the last stop on our visit to UCSB. And coincidentally, also the place that Claudia visited almost every day while she was studying at UCSB.


[User] Please transcribe this text

[Assistant] Time has passed so quickly while we've been here at UCSB. Do you still remember all of the places we visited?


[User] Please transcribe this text

[Assistant] Make sure you review what we've learned today. And I am going to enjoy the sunset on the beach.


[User] Please transcribe this text

[Assistant] Draw a picture and write about it. Science.


[User] Please transcribe this text

[Assistant] Why is rain important for plants, animals, and people?


[User] Please transcribe this text

[Assistant] Does London always give you the impression of being grey and damp? Do you think Londoners perpetuate the stereotype of being offish and restrained? Then you should come to Columbia Road Flower Market where your stereotype of London and Londoners will crumble.


[User] Please transcribe this text

[Assistant] The flower market has a history of over 150 years and is perhaps the most popular place for Londoners on every Sunday.


[User] Please transcribe this text

[Assistant] You see sellers hawking, and people holding massive bouquets of flowers everywhere. So romantic and colorful.


[User] Please transcribe this text

[Assistant] Connor is going to make a bouquet with the flowers he bought. I am a little worried. Is it going to look awesome or awful? And by the way, who is the bouquet for?


[User] Please transcribe this text

[Assistant] And it is possibly one of the Chinese people most cherished plants.


[User] Please transcribe this text

[Assistant] There is a bamboo forest in Sichuan province in southwest China.


[User] Please transcribe this text

[Assistant] Hundreds of millions of bamboos cover 27 mountains and more than 500 peaks.


[User] Please transcribe this text

[Assistant] And they are able to grow from shoots to mature bamboo in just 40 days.


[User] Please transcribe this text

[Assistant] Uh, it's a beautiful scene and a great party.


[User] Please transcribe this text

[Assistant] Hello grammarians. Hello David. Hello Paige. So today we're going to talk about apostrophes and plurals. And we talked about this a little bit in our introduction to the apostrophe video. This is a very, very rare case where we use an apostrophe to show that something is plural.


[User] Please transcribe this text

[Assistant] And it almost never happens, but we will explain when it does.


[User] Please transcribe this text

[Assistant] That one time is when you are pluralizing a lowercase letter.


[User] Please transcribe this text

[Assistant] So if you're saying something like, you need to remember to always dot your i's. Where you're talking about the letter i, and there are several of them. You're gonna put an apostrophe before the s.


[User] Please transcribe this text

[Assistant] Right, and you need to remember to always dot your is doesn't make any sense. Right. So.


[User] Please transcribe this text

[Assistant] Right, so this apostrophe can look like it's making the letter I possessive, but it's really just there to make it clear.


[User] Please transcribe this text

[Assistant] Right, cause you wouldn't just capitalize the word as in the middle of a sentence. Right.


[User] Please transcribe this text

[Assistant] Yeah, so, if you're trying to figure out how to make something plural, and you're like, do I use an apostrophe? No! Unless it's a lowercase letter. You can learn anything.


[User] Please transcribe this text

[Assistant] Hello, Zero Books readers. I am, uh, Conrad Hamilton, uh, I am the, uh, co-author of


[User] Please transcribe this text

[Assistant] I am the, uh, co-author of Myth and Mayhem, a leftist critique of Jordan Peterson, uh, as well as What is Postmodern Conservatism? Uh, and today we're, we're very happy today, uh, because, delighted, uh, because we have Bernard Stiegler here, uh, who I'm going to be interviewing.


[User] Please transcribe this text

[Assistant] Uh, and, uh, Bernard Stiegler is one of the most well-known, uh, living philosophers in France. Uh, he is the author of the, uh, celebrated Technics in Time trilogy.


[User] Please transcribe this text

[Assistant] Uh, he is the president of the Institute of Research and Innovation associated with the Centre Pompidou, uh, in Paris. Uh, he is an ex-student of Derrida, uh, and he is, I think it's fair to say, uh, a Marxist.


[User] Please transcribe this text

[Assistant] Uh, and Bernard's work, I'll say very briefly, uh, Bernard's work marries the question of Technics.


[User] Please transcribe this text

[Assistant] Uh, or the role that technical instruments play in the development of humankind to the intricate discourse of phenomenology.


[User] Please transcribe this text

[Assistant] Uhm, the first thing I just wanted to, uh, say is there, is there anything you'd like to add about your work, to add about the description that I gave?


[User] Please transcribe this text

[Assistant] Uh, so how do you, uh, maybe, you know, we could go on for a while, I imagine, but would you want to offer a brief summary of how you propose, uh, changing those discourses that you outlined?


[User] Please transcribe this text

[Assistant] Uhm, now this idea of de-proletarianization, uhm, earlier I described you, uh, as a Marxist and I was initially, I talked to Alvira about this because I was a bit hesitant to do this because I know you have a great interest, uh, in the work of Marx, you use the work of Marx, uh, but there are some very significant differences.


[User] Please transcribe this text

[Assistant] Uh, between, uh, your conception of, of capitalism, uh, techniques and so forth, compared with Marx. Uh, so one difference I believe is in the way you, you conceptualize proletarianization.


[User] Please transcribe this text

[Assistant] Uhm, for Marx, it, uh, you know, was suggestive of a certain kind of revolutionary possibility, uh, you know, inherent in the labor process of the factory, for example. Uh, whereas for you, you have a more cynical view, uh, of proletarianization. Uhm, do you want to maybe elaborate on that a little bit?


[User] Please transcribe this text

[Assistant] Not sure, Talon de Shield. It's a heal of, I'm not sure of what the, yeaah.


[User] Please transcribe this text

[Assistant] Uhm, so, okay, here we have a, we have a question here, uh, from the audience. Uh, within the context of generalized proletarianization, how do we interpret the reappearance of essential workers in popular discourse? Some would seem to be more proletarianized than others, no? So he's talking about, uhm, COVID-19, yea.


[User] Please transcribe this text

[Assistant] Can I, can I ask you just a follow-up question about proletarianization here?


[User] Please transcribe this text

[Assistant] Uhm, what I would like to ask is, you, you talked about the possibility that the potentially, uh, all workers, uh, could be, could be proletarianized or rendered redundant, uhm, in a certain way. If I'm not mistaking what you said.


[User] Please transcribe this text

[Assistant] Uhm, and you were talking about the risk of jobs being replaced by automation in the future. You mentioned 47% in the not so distant future.


[User] Please transcribe this text

[Assistant] But you know, of course, if we're looking in, in a Marxist context, uhm, you know, it's, uh, variable capital, right? Or, uh, the sale of labor power.


[User] Please transcribe this text

[Assistant] It's, it's, uh, capital variable, variable capital.


[User] Please transcribe this text

[Assistant] Or the the sale of labor power, uh, that actually, uh, furnishes the basis of, of surplus value and profit.


[User] Please transcribe this text

[Assistant] Uhm, so in practice, right, we've seen a great deal of automation, uh, but we've also seen that there are sectors that are more labor intensive, whether it be, uh, the service sector, uh, or whether it be, uh, you know, the huge factory complexes that exist in China.


[User] Please transcribe this text

[Assistant] From a Marxist standpoint, you would argue that, well, you know, that's where the surplus value is really coming from, right? That that's what's supporting the rate of profit.


[User] Please transcribe this text

[Assistant] Uhm, so when you, when you talk about, uhm, you know, the possibility that, that, uh,


[User] Please transcribe this text

[Assistant] Uhm, so maybe it would be good now just to shift a little bit off these more theoretical subjects and diverge a little bit into some of the political events that are happening right now. Because I think now people have maybe a sense of some of your views and what you pursue. So maybe we could talk a little bit about the


[User] Please transcribe this text

[Assistant] Uh, you just a minute ago, you spoke of perhaps the inevitability of a civil war in the United States.


[User] Please transcribe this text

[Assistant] Uh, we've seen in the past couple of weeks, there's been extensive protests, uh, as well as riots across the United States and elsewhere. Um, many of them calling for racial justice and the putting an end to police violence.


[User] Please transcribe this text

[Assistant] These were of course, uh, triggered by the publication of a video, uh, of the grotesque murder of George Floyd by Minneapolis police that went viral. And though I think there were some other factors, uh, you know, that, that generated frustration, like the unequal impact of COVID-19 in Black communities in the United States.


[User] Please transcribe this text

[Assistant] Now in the past few days, we can see that the demands of activists have underwent a very discernible shift.


[User] Please transcribe this text

[Assistant] Uhm, now, uh, many of them are calling for police departments to be abolished.


[User] Please transcribe this text

[Assistant] A term that is somewhat ambiguous in terms of what it could mean.


[User] Please transcribe this text

[Assistant] Uhm, do you have an opinion on this call to, uh, abolish, uh, police services, uh, or on these, uh, uprisings of the past couple of weeks more generally?


[User] Please transcribe this text

[Assistant] We have, uh, your critique of abolishing the police, uh, is partly that it's not fundamentally going to alter, uh, the underlying social conditions, uh, that, you know, dictate the need for police officers. Uh, that's sort of what I'm getting from you.


[User] Please transcribe this text

[Assistant] Uhm, but, uh, I just wanted to say about, about in terms of how you address, uh, Marxism and the history of enlightenment, uhm, you've talked about, uh, Marx's sort of complicity with, with dominant enlightenment notions. Uhm, and I think, you know, it's very clear that that is the case to a certain degree.


[User] Please transcribe this text

[Assistant] But the question of that degree I think varies a lot, uh, depending on who's reading Marx. So what occurs to me right now, uhm, there is a whole discourse now about, uh, Marx and what they call eco-socialism.


[User] Please transcribe this text

[Assistant] Right, so Marx's relationship to the question of climate change, uhm, you know, global warming, entropy and what have you.