JobsJob TrackerJob alerts

Rockstand ยท 9 questions

All 9Coding 8Low-Level Design 1
  • Check if strings are rotations of each otherCoding
  • Find intersection of two sets of digitsCoding
  • Swap kth node from beginning and end in linked listCoding
  • Return second largest element from an arrayCoding
  • Implement linked list operationsCoding
  • Create GUI and database connectivityLow-Level Design
  • Implement BSTCoding
  • Merge sort and medianCoding
  • Implement CacheCoding
โ† Rockstand questions
  1. Interview questions
  2. Rockstand
  3. Implement BST
Coding

Implement BST

Filed under Rockstand

The question

Implement a Binary Search Tree data structure.

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

Related Rockstand questions

  • Find intersection of two sets of digits
  • Swap kth node from beginning and end in linked list
  • Return second largest element from an array
  • Merge sort and median
  • Implement Cache
โ† Create GUI and database connectivityMerge sort and median โ†’

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