Interview Question

Summer Technical Intern Interview

What is the difference between a binary tree and an ordered

  binary tree? Question was so simple it threw me off
Answer

Interview Answer

1 Answer

0

Technically speaking, it's defined as: all sub-nodes to a node have values <= that of the node.
In rough terms it means the tree is sorted left to right (left=most node has lowest value, right-most has highest).

Bruce Steinback on Jul 10, 2013

Add Answers or Comments

To comment on this question, Sign In with Facebook or Sign Up