JobsJob TrackerJob alerts

Infibeam Avenues Limited · 14 questions

All 14Coding 13
  • Find the maximum depth or height of a treeCoding
  • Flatten a linked list with next and child pointersCoding
  • Bottom view of a binary treeCoding
  • Print left view of a binary treeCoding
  • Check if a binary tree is BSTCoding
  • Merge k sorted arraysCoding
  • Sort elements by frequencyCoding
  • Search in row-wise and column-wise sorted matrixCoding
  • Frogs and switches problem
  • Turn off a particular bit in a numberCoding
  • Kth smallest/largest element in unsorted arrayCoding
  • Inversion count in array using merge sortCoding
  • Longest prefix also suffixCoding
  • Find next greater number set digitsCoding
← Infibeam Avenues Limited questions
  1. Interview questions
  2. Infibeam Avenues Limited
  3. Check if a binary tree is BST
Coding

Check if a binary tree is BST

Filed under Infibeam Avenues Limited · Also reported at 1mg

The question

Determine if a given binary tree satisfies the Binary Search Tree property.

No write-up yet. Related questions below have one.

Related Infibeam Avenues Limited questions

  • Find the maximum depth or height of a tree
  • Turn off a particular bit in a number
  • Inversion count in array using merge sort
  • Longest prefix also suffix
  • Find next greater number set digits
← Print left view of a binary treeMerge k sorted arrays →

Collected from public candidate posts and coding forums. Updated Nov 2026.