Difference between binary search tree and heap
  • Posted: 5 years ago
  • Edit
  • answers (1)
  • views (7621)

What is the difference between binary search tree and heap?


Posted Answers

In binary search tree, for every node except the leaf node, the left child has a less key value and right child has a greater key value.

In heap, for every node other than the root, the key value of the parent node is greater or equal to the key value of the child node.

You need to Sign In to post your solution.