목록2021/07/16 (1)
규도자 블로그
[해커랭크(Hackerrank)/30 Days of Code/파이썬3(python3)] Day 22: Binary Search Trees
Objective Today, we're working with Binary Search Trees (BSTs). Check out the Tutorial tab for learning materials and an instructional video! Task The height of a binary search tree is the number of edges between the tree's root and its furthest leaf. You are given a pointer, , pointing to the root of a binary search tree. Complete the getHeight function provided in your editor so that it return..
알고리즘/풀이
2021. 7. 16. 12:29