Tree Posted May 7, 2021 By Hyoeun Choi 1 min read Tree Contents Tree BST(Binary Search Tree)루트의 왼쪽은 루트보다 작은 값, 오른쪽은 루트보다 큰 값이 들어간다.모든 값은 unique하다고 가정한다..Time Complexity는 O(h) - h는 높이다. Software Engineering, Algorithms Tree Data-Structures Algorithms This post is licensed under CC BY 4.0 by the author. Share