Skip to main content
Home
CEAPP

  • Home
  • Browse
  • Browse (ClassBank)
  • Actions and Practices
  • Search
  • Tutorials
  • Research
  • People
  • CRELLT

Breadcrumb

  1. Home
  2. Transcript Table

Transcript Table

Note: Lines that are metadata or do not contain timestamps are greyed out and do not have active links.

Results of Search: 176,291 lines — Showing 170221 - 170240.

Pagination

  • First page
  • Previous page
  • …
  • Page 8508
  • Page 8509
  • Page 8510
  • Page 8511
  • Page 8512
  • Page 8513
  • Page 8514
  • Page 8515
  • Page 8516
  • …
  • Next page
  • Last page
Course Level Date Clip# Line Interlocutor Content
- - - 1 95 UNK (0.4)
- - - 1 96 S01 uh hi everyone today I would like to introduce
- - - 1 97 S01 ⁎binary tree→ and this is um (0.4) one of the⁎
- - - 1 98 S01 xxx structures in computer science↘ you know
- - - 1 99 S01 they are- we have many trees ⁎but binary⁎→
- - - 1 100 S01 (.) for me is that this tree have ⁎two branch⁎↘
- - - 1 101 UNK (0.3)
- - - 1 102 S01 the left branch→ (1.2) and the right branch↘
- - - 1 103 UNK (2.7)
- - - 1 104 S01 and we can see ⁎from the left tree⁎→ (0.3)
- - - 1 105 S01 each tree may have ⁎nodes or may not have⁎
- - - 1 106 S01 nodes↘ so if xxx missing this xxx t- tree uh
- - - 1 107 S01 (.) ⁎uh in this part (0.3) and uh (0.4) um⁎
- - - 1 108 S01 ⁎⁇unfree⁇⁎ xxx (0.3) you have to ⁇fill⁇ ⁎out⁎
- - - 1 109 S01 (0.3) with uh ⁇fit⁇ (1.3) oh (0.4) excuse me
- - - 1 110 UNK (0.4)
- - - 1 111 S01 ⌈um
- - - 1 112 T01 ⌊mhm
- - - 1 113 S01 can I talk something more about that xxx tree↗
- - - 1 114 T01 mhm mhm≈
  • Reset your password
Powered by Drupal