Created: 2024-10-21 15:48 Category: #data-structures Status: #philnits
![[Pasted image 20241021154848.png]] ? ![[Pasted image 20241021154924.png]]
- Each node in a BST has at most two children, a left child and a right child. The left child contains values less than the parent node, and the right child contains values greater than the parent node.