binary tree
-
Binary Search TreeAlgoDS/DataStructure 2020. 1. 13. 10:19
1. Overview Unlike other sequential structures such as linked list, queue, stack, and array, which are one element after another and sort of a line of things, It has a hierarchical data structure like a tree. A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can have only 2 children, we typically name them the left and right child. Root: T..