0:00
Hi to everyone.
00:01
So first insert.
00:03
This is for unbalanced binary search tree.
00:09
Okay, so insert 94, insert 33, so it will be 94, 94 into 33, so 94, insert 50, 50, so 94, 33, 50, then insert 76, so 94, 33, 50, 76.
00:35
Okay, so in the same way, insert next, insert 96, 67, 56, 56, 65, 83 and 34.
00:51
Okay, so in 94, 33, 50, 76, then 96.
01:03
Okay, same process 94, 33, 50, 76, 96, 67.
01:12
Again, 94, 33, 50, last 56, 94, 33, 50, 76, 96, 56, 65.
01:24
Okay, 94, 33, 50, continuation last 83.
01:31
Then 94, 33, 50, 76, 96, 67, 56, 65, 83, 34...