Q: Describe a binary tree implementation.
Anonymous
Ordered tree structure in which every node has two children. Left child is always less than the current node, while right child is always larger.
Check out your Company Bowl for anonymous work chats.