Want a Free Job Posting?

Buy a job posting today and the second one is on us. For a limited time only. Act Now.

Interview Question


What is the difference between a binary tree and an ordered

  binary tree? Question was so simple it threw me off

Interview Answer

1 Answer


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, Sign In or Sign Up.