A binary tree has nodes with at most two children. In a binary search tree, left < node < right.
Short cards. Read them, then check your understanding below.
Answer each activity and press Check. Wrong answers turn red. Press Show me if you are stuck.
Revise this chapter in the AsghinLabs Academy workbooks.