슬롱주리 Selon Julie

Very similar to a binary search tree, but with some different rules MaxBinaryHeap: parent nodes are always larger than child nodes Only rule : A child must be smaller than the parent. MinBinaryHeap: parent nodes are always smaller than child nodes left child is added and then a right child. No guarantees between sibling nodes (So again, no implied ordering between siblings.) used to implement Pr..

Visit every node once? 2 approaches Breadth-first search(BFS) Depth-first search(DFS) Pre-order Post-order In-order Breadth-first search(DFS) - horizontally We want to visit every node on the same level, every sibling node before we look at a child. (horizontally) Steps - Iteratively Create a queue (FIFO, this can be an array) and a variable to store the values of nodes visited Place the root no..

Tree What is tree So trees are data structures that consist of nodes, just like the links listed, but they are in a parent child relationship Lists - linear Trees- nonlinear A singly linked list (sort of a special case of a tree) Rules So a node can only point to a child. It's a parent child relationship. We can't have a child pointing to a parent. We can't have a node pointing to a sibling. You..

Queues just for adding a removing (just like stack) FIFO(First In First Out) data structure eg. game waiting list, uploading - download background task on your computer, printer Array implementation : it is not ideal! performance wise, class is better push - shift Of course, one thing that's not great when we do this is if we had 10,000 items in there, they each have an index and removing from t..

Stacks abstract data structure, collection - it's a concept LIFO(last in first out) principle Call stack! (recursion) They are not a built in data structure in Javascript, but are relatively simple to implement Where is it used Managing function invocations undo/redo (ctrl+Z) history object (routing is treated like a stack) trees, graphs Array implementation more than one way of doing it, easies..

Insert Adding a new node to the linked list at a specific position Insert pseudocode if the index is less than zero or greater than the length, return false if the index is the same as the length, push a new node to the end of the list if the indiex is 0, unshift a new node to the start of the list Otherwise, using the get method, access the node at the index -1 create a new node, set the next p..

What is Quick sort Like merge sort, exploits the fact that arrays of 0 or 1 element are always sorted Works by selecting one element(called the 'pivot) and finding the index where the pivot should end up in sorted array Once the pivot is positioned appropriately, quick sort can be applied on either side of the pivot How does it work? https://visualgo.net/en/sorting Sorting (Bubble, Selection, In..

Intermediate sort merge sort quick sort radix sort time complexity from O(n^2) to O(n log n) Merge sort spliting up + merging + sorting exploits the fact that arrays of 0 or 1 element are always sorted works by decomposing an array into smaller arrays of 0 or 1 elements, then building up a newly sorted array How does it work? 1. Merging arrays: merge 2 sorted arrays In order to implement merge s..

Builds up the sort by gradually creating a larger left half which is always sorted [5, 3, 4, 1, 2] [3, 5, 4, 1, 2] [3, 4, 5, 1, 2] [1, 3, 4, 5, 2] [1, 2, 3, 4, 5] visualgo | insertion sort Pseudocode start by picking the second element in the array now compare the second element with the one before it and swap if necessary continue to the next element and if it is in the incorrect order, iterate..

Smiliar to bubble sort, but instead of first placing large values into sorted position, it places small values into sorted position. 처음것과 그 다음 배열을 차례대로 비교해서 최소의 수를 '맨 마지막에' 앞으로 옮김, 그 후 반복 [5, 3, 4, 1, 2] [5, 3, 4, 1, 2] [5, 3, 4, 1, 2] [5, 3, 4, 1, 2] [1, 3, 4, 5, 2] Pseudocode store the first element as the smallest value you've seen so far compare this item to the next item in the array until ..