Files
obsidian/АиСД/Методы/BST.md
T
roma-dxunvrs 0e6e583e6d
deploy / Pull and Restart (push) Successful in 17s
refactor: wiki links -> md links
2026-09-22 08:52:23 +03:00

6 lines
569 B
Markdown

Бинарное дерево поиска, база - [Деревья](../Структуры/Деревья.md)
## Примеры задач
- [Lowest Common Ancestor of a Binary Tree](../Задачи/LeetCode/Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree.md)
- [Lowest Common Ancestor of a Binary Tree III](../Задачи/LeetCode/Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III.md)
- [Range Sum of BST](../Задачи/LeetCode/Range%20Sum%20of%20BST.md)
- [Validate Binary Search Tree](../Задачи/LeetCode/Validate%20Binary%20Search%20Tree.md)