Is a Binary Search Tree (BST) a type of binary tree where each node has at most two children?
Yes
No
ESC
Close
A Binary Search Tree (BST) is indeed a type of binary tree where each node has at most two children, specifically a left and a right child.
