Kim Jinung

Trie - Wikipedia From Wikipedia, the free encyclopedia Jump to navigation Jump to search K-ary search tree data structure This article is about a tree data structure. For the French commune, see Trie-sur-Baïse. TrieTypetreeInvented1960Invented byEdward Fredkin, Axel Thue, en.wikipedia.org 탐색 트리의 일종으로 노드의 자체의 정보를 저장하는 것이 아니라 포지션과 관련된 정보를 저장한다. 일반적으로 문자열 색인을 구축하는 형태로, 각 인덱스에 해당하는 character를 Key로 저..

Self-balancing binary search tree - Wikipedia From Wikipedia, the free encyclopedia Jump to navigation Jump to search Any node-based binary search tree that automatically keeps its height the same An example of an unbalanced tree; following the path from the root to a node takes an average of 3.27 nod en.wikipedia.org Self-balancing BST는 트리의 높이를 가능한 작게 유지하여 트리의 성능을 보장한다. BST의 문제점 BST는 최악의 경우에서 O..

Abstract data type - Wikipedia From Wikipedia, the free encyclopedia Jump to navigation Jump to search Mathematical model for data types In computer science, an abstract data type (ADT) is a mathematical model for data types. An abstract data type is defined by its behavior (semantics) en.wikipedia.org What is the difference between an Abstract Data Type(ADT) and a Data Structure? I have found b..

Heap (data structure) - Wikipedia From Wikipedia, the free encyclopedia Jump to navigation Jump to search Computer science data structure For the memory heap (in low-level computer programming), which bears no relation to the data structure, see C dynamic memory allocation. Example of a bi en.wikipedia.org Heap은 tree 기반의 자료구조로, max heap과 min heap이 있다. max heap은 root node가 항상 최댓값이며 반대로 min heap은 ..