1
00:00:07,050 --> 00:00:09,630
[Powered by Google Translate] Quomodo esset repraesentes omnem cognationem tuam sodales in a computer?

2
00:00:10,790 --> 00:00:12,390
Possemus simpliciter utor a album,

3
00:00:12,390 --> 00:00:14,400
tamen illic 'clara hierarchiae hic.

4
00:00:14,400 --> 00:00:17,110
>> Aliquam sit amet initio cum dicimus proaviae Alicie.

5
00:00:17,110 --> 00:00:19,030
Habet illa II filios, Bob

6
00:00:19,030 --> 00:00:21,310
et avi tui, Charlie.

7
00:00:21,310 --> 00:00:23,190
Charlie habet III filios,

8
00:00:23,190 --> 00:00:26,730
avunculus tuus, Davus tibi adfinitate Eva et pater Fred.

9
00:00:26,730 --> 00:00:28,750
Tu es Fred scriptor solum parvulus.

10
00:00:28,750 --> 00:00:30,950
>> Cur ordinandis vestra familia sodales in hoc modo

11
00:00:30,950 --> 00:00:34,010
, meliorem esse quam indicem simplicem repraesentatione?

12
00:00:34,010 --> 00:00:36,630
Una ratio est quod hoc structuram hierarchicam,

13
00:00:36,630 --> 00:00:39,660
dicatur arborem plus quam simplex adipiscing elit.

14
00:00:40,540 --> 00:00:43,520
Scimus et familiaria necessitudines inter omnes

15
00:00:43,520 --> 00:00:45,440
iustus perscrutantes arbore.

16
00:00:45,440 --> 00:00:47,250
Item, potest accelerare

17
00:00:47,250 --> 00:00:50,010
inviso-sursum tempus LONGE, si arbor notitia est sorted.

18
00:00:50,010 --> 00:00:53,850
>> Quod uti non potest, sed certe videtis quale illud elit.

19
00:00:53,850 --> 00:00:56,150
Node per quam quisque in ligno.

20
00:00:56,680 --> 00:00:58,370
Nodorum potest habere puer nodorum

21
00:00:58,370 --> 00:01:00,350
node ac parentis.

22
00:01:00,350 --> 00:01:02,390
Hi sunt verbis technicis,

23
00:01:02,390 --> 00:01:05,220
etiam cum usura arboribus rebus praeter familias suas.

24
00:01:05,220 --> 00:01:07,940
Alicia est scriptor node habet II filios, et nulli parentes,

25
00:01:07,940 --> 00:01:11,500
dum Charlie scriptor node habet III liberis et I parentis.

26
00:01:11,500 --> 00:01:14,330
>> Node folium, quod liberos non habent

27
00:01:14,330 --> 00:01:16,410
partem extra nemus.

28
00:01:16,410 --> 00:01:18,520
Node summum arboris radix nodo

29
00:01:18,520 --> 00:01:20,240
non habet parentis.

30
00:01:20,240 --> 00:01:23,170
>> Bina specie genus arboris arbor,

31
00:01:23,170 --> 00:01:26,720
in qua unusquisque node habet, ad plus, II filiis.

32
00:01:26,720 --> 00:01:30,490
Hic est instrúite of a node binarii arbor in C.

33
00:01:31,560 --> 00:01:34,530
Omnis node habet aliquam notitia associatur

34
00:01:34,530 --> 00:01:36,520
et II indicibusque ad alia nodorum.

35
00:01:36,520 --> 00:01:38,110
>> In nostra familia ligno,

36
00:01:38,110 --> 00:01:40,900
siue notitia erat unius cuiusque hominis nomen.

37
00:01:40,900 --> 00:01:43,850
Hic is est an int, licet posset esse aliquid.

38
00:01:44,510 --> 00:01:46,200
Ratione obversa foras,

39
00:01:46,200 --> 00:01:48,990
arborem bonam esse ad imaginem bina familias

40
00:01:48,990 --> 00:01:51,960
II Cum enim saepe plures filios.

41
00:01:51,960 --> 00:01:53,510
>> A binariae search arbor

42
00:01:53,510 --> 00:01:56,380
est specialis, dispositos typus of binariae arbor

43
00:01:56,380 --> 00:01:58,090
quod permittit nos aspicere valores cito.

44
00:01:58,740 --> 00:02:00,050
Vos may have Animadvertistine,

45
00:02:00,050 --> 00:02:02,010
quod omnis node infra radix arboris

46
00:02:02,010 --> 00:02:04,620
alterius arboris radix dicatur subtree.

47
00:02:04,960 --> 00:02:07,090
Hic radicem arboris VI,

48
00:02:07,090 --> 00:02:09,860
et puer II, radix est subtree.

49
00:02:09,860 --> 00:02:11,870
>> In binarii search arbor

50
00:02:11,870 --> 00:02:15,790
node omnes valores a iure subtree

51
00:02:15,790 --> 00:02:18,690
sunt maiores quam node scriptor valorem. Hic: VI.

52
00:02:18,690 --> 00:02:22,640
Bene, valores in node scriptor sinistram subtree

53
00:02:24,540 --> 00:02:26,890
minus sunt quam node scriptor valorem.

54
00:02:26,890 --> 00:02:28,620
Si nos postulo ad tractandum duplicata valores,

55
00:02:28,620 --> 00:02:31,760
soluta nobis est mutare alteram inaequalitatem

56
00:02:31,760 --> 00:02:34,410
Volensque identificantur valores aut cadet a sinistris sive jus

57
00:02:34,410 --> 00:02:37,400
dum stant in circuitu.

58
00:02:37,400 --> 00:02:39,620
Hanc arborem binarii search arbor

59
00:02:39,620 --> 00:02:41,540
quia sequitur has regulas.

60
00:02:42,320 --> 00:02:46,020
>> Hoc modo aspicere vellet si nos vertebat omnes nodorum in C structs.

61
00:02:46,880 --> 00:02:48,410
Nota quod si puer defuerit,

62
00:02:48,410 --> 00:02:50,340
in monstratorem est nulla.

63
00:02:50,340 --> 00:02:53,270
VII Quomodo si reprimatur, est in ligno?

64
00:02:53,270 --> 00:02:55,020
Nos satus ad radicem.

65
00:02:55,020 --> 00:02:58,690
VI, quam septem, si in illud lignum rectum sit.

66
00:02:59,680 --> 00:03:03,650
Ergo minus VIII, ideoque relinqui.

67
00:03:03,650 --> 00:03:06,210
Ubi invenimus VII.

68
00:03:06,210 --> 00:03:08,160
Nunc, puteus 'reprehendo pro V.

69
00:03:08,160 --> 00:03:11,500
VI, minor V et ad sinistram sit.

70
00:03:11,500 --> 00:03:13,460
Quinque maior est quam II,

71
00:03:13,460 --> 00:03:15,010
sic oportet recta esse,

72
00:03:15,010 --> 00:03:18,100
IV, maior est et ita debet esse recta est.

73
00:03:18,100 --> 00:03:20,300
Sed puer non est.

74
00:03:20,300 --> 00:03:22,000
In monstratorem est nulla.

75
00:03:22,000 --> 00:03:24,270
V id est in ligno.

76
00:03:24,270 --> 00:03:27,250
>> Quisque bibendum quam quaerimus bina ligna,

77
00:03:28,430 --> 00:03:31,140
Omni nodo si invenimus compescimus

78
00:03:31,140 --> 00:03:33,020
pretium quaerunt.

79
00:03:33,020 --> 00:03:35,740
Quod si non invenerit, si statuimus

80
00:03:35,740 --> 00:03:38,990
in laevam, seu dexteram et coercere qui subtree.

81
00:03:38,990 --> 00:03:41,160
Hoc loop mos persevero dejicit arborem

82
00:03:41,160 --> 00:03:44,190
Donec vel nulla a laeva sive dextera nodum gravida.

83
00:03:45,190 --> 00:03:48,600
>> V arboris haud memini.

84
00:03:48,600 --> 00:03:50,460
Quomodo nos inserere eam?

85
00:03:50,460 --> 00:03:52,370
Processus spectat simile quaerere incipient.

86
00:03:52,370 --> 00:03:54,830
Nos RESUMO dejicit arborem incipiens ex VI,

87
00:03:54,830 --> 00:03:57,040
relinquitur II,

88
00:03:57,040 --> 00:03:59,140
ius IV,

89
00:03:59,140 --> 00:04:02,500
ius vero liberos sed habens hinc IV.

90
00:04:02,500 --> 00:04:06,090
V loco novum erit,

91
00:04:06,090 --> 00:04:08,500
Lorem ipsum et liberos.

92
00:04:09,020 --> 00:04:12,220
>> Quomodo jejunare, operationes super binarii search arborem?

93
00:04:12,220 --> 00:04:15,410
Memento quod Bigohnotation quaerit suggero an superiorem ligatus.

94
00:04:15,410 --> 00:04:17,390
Ad deterrima casu,

95
00:04:17,390 --> 00:04:19,480
nostri arbor posset simpliciter esse connexionem list

96
00:04:19,480 --> 00:04:22,220
volens quod insertus, expunctione, et investigent

97
00:04:22,220 --> 00:04:25,380
proportionalis numero nodorum possent in tempore fructus.

98
00:04:25,380 --> 00:04:27,380
Haec O (n).

99
00:04:27,380 --> 00:04:30,690
>> Pro exemplo, sequentia validum est, binariae search arbore.

100
00:04:31,850 --> 00:04:34,020
Si autem invenire IX,

101
00:04:34,020 --> 00:04:36,760
habemus percurrere omnis node.

102
00:04:36,760 --> 00:04:39,120
Nihil ab hoc vinculo elit.

103
00:04:39,120 --> 00:04:41,410
Specimen, nos velimus omnis node

104
00:04:41,410 --> 00:04:44,120
nostri binariae search arbor habere II filiis.

105
00:04:44,120 --> 00:04:46,370
Via hac, insertus, deletionem et investigent

106
00:04:46,370 --> 00:04:50,190
capturus, at pessima, O (log n) tempus.

107
00:04:50,190 --> 00:04:52,470
Ab arbore tarn librata

108
00:04:52,470 --> 00:04:54,140
sicut est hodie.

109
00:04:54,140 --> 00:04:57,980
Nunc, suspiciens quovis valore accipit, ad plus, III steps.

110
00:04:57,980 --> 00:04:59,460
Hanc arborem libratum,

111
00:04:59,460 --> 00:05:01,190
id est altitudinem minime

112
00:05:01,190 --> 00:05:03,680
relative ad numerum nodorum.

113
00:05:03,680 --> 00:05:06,300
>> Exspectantes valoris in aequabilis binariae search arbor

114
00:05:06,300 --> 00:05:09,540
similis est binariae search in sorted ordinata.

115
00:05:09,540 --> 00:05:12,290
Si enim vel lectus aliquam non oportet inserere,

116
00:05:12,290 --> 00:05:15,150
ipsi conversari eodem prorsus modo.

117
00:05:15,150 --> 00:05:17,600
Tamen, arbor structura est melius

118
00:05:17,600 --> 00:05:19,530
pro pertractatio insertiones et deletions

119
00:05:20,360 --> 00:05:22,670
>> Est nomen meum Bannus Van der Kloot.

120
00:05:22,670 --> 00:05:24,030
Hoc est CS50.