Analyst Integration Question:
What is difference between a binary tree and a binary search tree?
Answer:
Binary search tree is an ordered binary tree, where value of all nodes in left tree are less than or equal to node and values of all nodes in right sub tree is greater than or equal to node (e.g. root). It's an important data structure and can be used to represent a sorted structure.
| Previous Question | Next Question |
| What is the relationship between threads and processes? | What is the difference between an inner join and a left join in SQL? |