profile
'과연 이게 최선일까?' 끊임없이 생각하기
태그 목록
전체보기 (201)DFS(8)완전탐색(4)Sort(4)BFS(3)재귀(3)splice(3)useEffect(3)this(3)queue(3)API(2)toggle(2)greedy(2)reduce(2)hash(2)setInterval(2)setTimeout(2)발상의 전환(2)useInterval(2)useState(2)stack(2)&&(2)Que(2)combination(2)useMemo(2)dynamic array(2)Binary Search(2)google(1)mutaionObserver(1)test(1)canvas(1)withCount(1)corona(1)search(1)routing(1)kwargs(1)function(1)undefined(1)heroku(1)dic(1)mixin(1)Fiber(1)scss(1)destructuring(1)cors(1)component(1)Pivot(1)min-width(1)promise(1)every(1)H Index(1)WILDCARD(1)history API(1)순수함수(1)contains()(1)고딩때의 추억(1)GET(1)POST(1)makeStyles(1)프로그래머스(1)debugger(1)alias(1)slug(1)OOP(1)merge(1)align self(1)restful api(1)DNS(1)bind(1)customState(1)stackoverflow(1)createStyles(1)선언형 방식(1)smoking test(1)스켈레톤(1)개발자 vibe(1)commands(1)NOT(1)Request(1)약수의 갯수(1)boolean(1)findIndex(1)fibonacci(1)memoization(1)함수형 컴포넌트(1)cypress(1)quick(1)vmin(1)nth-of-type(1)variables(1)Helper(1)sortable(1)reconciliation(1)beforeunload(1)dijkstra(1)라우팅(1)MVC(1)Trie(1)beautifulsoup(1)navigate(1)해쉬(1)debounce(1)HistoryAPI(1)BLOGGING(1)Object.assign(1)"for 와 recursive의 조화(1)high order function(1)Prototype(1)await(1)cachememory(1)nth-child(1)skeleton(1)try/except(1)rules of hooks(1)Statement(1)wait()(1)async(1)rstrip(1)다시 만들기(1)return(1)class(1)for(1)cmd(1)bubble(1)JavaScript(1)singly linked list(1)render_template(1)useParams(1)pagination(1)고차함수(1)Higher-order Function(1)tailwind(1)ESLint(1)Call By Reference(1)progress(1)unshift(1)span(1)div(1)nested for loop(1)auto-complete(1)react testing library(1)wrap(1)If_Else(1)documentFragment(1)mini project(1)json(1)drag and drop(1)크루스칼(1)replace(1)visible(1)format(1)Prime(1)diffing(1)componentWillUnmount()(1)다중 정렬(1)expression(1)CS(1)End to End Test(1)filter(1)props.children(1)z-index(1)debugging(1)Hash brown 맛있겠다(1)new Intl(1)ARP(1)delete(1)mixitup(1)base_url(1)font awesome(1)부분집합(1)jquery(1)media query(1)RAM(1)State(1)useReducer(1)LILO(1)sqlite(1)global(1)응급상황(1)DOM(1)DB 설계(1)good_job(1)PriorityQueue(1)styled(1)memory leakage(1)hook(1)useCallback(1)fixtures(1)CustomHook(1)꼭꼭 숨어라 머리카락 보일라(1)이중포문(1)double bang(1)CSR(1)SSR(1)콜트짱!(1)preventDefault(1)localstorage(1)Pop(1)inline(1)transition(1)split()(1)max(1)f-string formatting(1)CustomEvent(1)tryCatch(1)extends(1)Then(1)Fetch(1)submit(1)dict(1)addEventListener(1)doubly linked list(1)Delegation(1)LIFO(1)jest(1)MAX_PAGE(1)change event(1)HoC(1)useLocation(1)dash(1)인형뽑기(1)random(1)FLOOR(1)lazy(1)validator(1)JSX(1)Flask(1)super excited(1)auto fit(1)auto fill(1)useNavigate(1)dblclick(1)life cycle(1)debug(1)Map(1)그래프(1)regexp(1)CRUD(1)new Date(1)withStyle(1)data set(1)clean-up(1)Props(1)Content(1)min(1)dispatchEvent(1)plotly(1)csv(1)color palette(1)pandas(1)grid(1)max-width(1)나무(1)dynamic programming(1)좋은 개발자(1)emotion(1)audio(1)set(1)react router(1)생명주기(1)시각화(1)Compound Components pattern(1)이중 포인터(1)
post-thumbnail

Binary Heap

Binary Heap(이하 BH)은 BST보다 간단하다. MAX인지 MIN인지에 따라서 부모가 자식보다 크냐 아님 작으냐로 구분하기만 하면 된다. 형제노드사이의 관계는 전혀 없다. 그냥 부모보다 작으면 된다. 그럼 영어로 설명을 적어보겠다.Binary heap\-- V

2021년 11월 20일
·
0개의 댓글