A binary tree where left child is less than or equal to the parent, while the right child is greater You are given the root node of a binary search tree (BST) and a value to insert into the tree.

Stack is the data structure The first item that comes in will be the first to go out. Open brackets must be closed by the same type of brackets. Open brackets must be closed in the correct order.