1/3
afasf
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai | Chat |
|---|
No analytics yet
Send a link to your students to track their progress
In order Traversal
left, root, right
post order traversal
left, right, root
pre order traversal
root, left, right
Binary search tree
data structure that maintains a sorted order, where each node's left subtree contains only nodes with keys less than the node's key, and the right subtree contains only nodes with keys greater than the node's key.