.pf{position:relative;background-color:#fff;overflow:hidden;margin:0;border:0}.pc{position:absolute;border:0;padding:0;margin:0;top:0;left:0;width:100%;height:100%;overflow:hidden;display:block;transform-origin:0 0;-ms-transform-origin:0 0;-webkit-transform-origin:0 0}.bi{position:absolute;border:0;margin:0}.c{position:absolute;border:0;padding:0;margin:0;overflow:hidden;display:block}.t{position:absolute;white-space:pre;font-size:1px;transform-origin:0 100%;-ms-transform-origin:0 100%;-webkit-transform-origin:0 100%;unicode-bidi:bidi-override;-moz-font-feature-settings:"liga" 0}.t:after{content:''}.t:before{content:'';display:inline-block}.t span{position:relative;unicode-bidi:bidi-override}._{display:inline-block;color:transparent;z-index:-1}.pi{display:none}@media screen{.pf{margin:13px auto;box-shadow:1px 1px 3px 1px #333;border-collapse:separate}}.ff1{font-family:ff1;line-height:.981934;font-style:normal;font-weight:400;visibility:visible}.ff2{font-family:ff2;line-height:.766602;font-style:normal;font-weight:400;visibility:visible}.ff3{font-family:ff3;line-height:.98291;font-style:normal;font-weight:400;visibility:visible}.ff4{font-family:ff4;line-height:1.432;font-style:normal;font-weight:400;visibility:visible}.ff5{font-family:ff5;line-height:.9375;font-style:normal;font-weight:400;visibility:visible}.m0{transform:matrix(.320260,0,0,.320260,0,0);-ms-transform:matrix(.320260,0,0,.320260,0,0);-webkit-transform:matrix(.320260,0,0,.320260,0,0)}.ls7{letter-spacing:-.206800px}.ls5{letter-spacing:0}.ls4{letter-spacing:.088320px}.ls2{letter-spacing:.099840px}.ls3{letter-spacing:.1px}.ls6{letter-spacing:.170800px}.ls0{letter-spacing:26.12352px}.ls1{letter-spacing:46.28352px}.sc0{text-shadow:-.015em 0 transparent,0 .015em transparent,.015em 0 transparent,0 -.015em transparent}@media screen and (-webkit-min-device-pixel-ratio:0){.sc0{-webkit-text-stroke:.015em transparent;text-shadow:none}}.ws0{word-spacing:-80.16px}.ws3{word-spacing:-14.221040px}.ws1{word-spacing:-10.150960px}.ws2{word-spacing:-9.980160px}.ws4{word-spacing:0}._0{margin-left:-1.22368px}.fc1{color:#538135}.fc0{color:#000}.fs3{font-size:32.16px}.fs1{font-size:44.16px}.fs2{font-size:63.84px}.fs0{font-size:80.16px}.y1e{bottom:9.684674px}.y9{bottom:15.833674px}.y17{bottom:15.987399px}.y25{bottom:136.687135px}.y24{bottom:165.433708px}.y23{bottom:184.034431px}.y22{bottom:202.48143px}.y21{bottom:219.544903px}.y0{bottom:229.306440px}.y20{bottom:229.844478px}.y1f{bottom:265.085931px}.y1d{bottom:278.92118px}.y1c{bottom:313.970477px}.y1b{bottom:342.717050px}.y1a{bottom:371.617348px}.y19{bottom:390.064346px}.y18{bottom:408.665070px}.y16{bottom:422.500319px}.y15{bottom:457.549616px}.y14{bottom:476.150339px}.y13{bottom:494.776684px}.y12{bottom:513.377407px}.y11{bottom:542.12398px}.y10{bottom:571.024278px}.yf{bottom:589.471276px}.ye{bottom:608.072000px}.yd{bottom:626.672723px}.yc{bottom:655.419296px}.yb{bottom:684.319594px}.ya{bottom:702.805024px}.y8{bottom:716.793997px}.y7{bottom:751.843295px}.y6{bottom:770.290293px}.y5{bottom:788.891017px}.y4{bottom:807.49174px}.y3{bottom:836.238313px}.y2{bottom:865.138611px}.y1{bottom:898.035758px}.h9{height:25.847344px}.h6{height:29.054023px}.h7{height:29.207748px}.h3{height:35.491875px}.h5{height:35.535px}.h4{height:50.69568px}.h8{height:51.37125px}.h2{height:64.425469px}.h1{height:516.900272px}.h0{height:1014.58492px}.w2{width:28.439123px}.w3{width:28.469868px}.w6{width:33.973222px}.w4{width:34.003967px}.w5{width:34.126947px}.w1{width:341.397577px}.w0{width:783.997438px}.x6{left:6.610174px}.x2{left:92.265738px}.xe{left:128.539711px}.x3{left:138.37811px}.x0{left:149.881863px}.x5{left:154.826684px}.x4{left:161.436858px}.x7{left:183.880706px}.x8{left:212.934729px}.x9{left:242.142477px}.xa{left:271.234931px}.xf{left:276.769030px}.x1{left:291.372904px}.xb{left:300.288953px}.x10{left:305.823053px}.xc{left:329.342976px}.x11{left:334.877076px}.xd{left:358.396999px}.x12{left:369.618923px}.x13{left:398.672946px}.x14{left:427.752589px}.x15{left:462.340711px}

CS234 Lecture Notes - Lecture 8: Linked List, Time Complexity, Doubly Linked List

Python list: adjustable size (requires allocation of new array) L = [ none ] * 1,000,0000 

CS234 Lecture Notes - Lecture 8: Linked List, Time Complexity, Doubly Linked List

Document Summary

Get access

Related Documents

CS234 Lecture Notes - Linked List, Reference Class Problem, Time Complexity

CS234 Study Guide - Final Guide: Priority Queue, Abstract Data Type, Data Type

CS234 Study Guide - Final Guide: Binary Tree, Bubble Sort, Insertion Sort