JobsJob TrackerJob alerts

Zeotap ยท 11 questions

All 11Coding 10Low-Level Design 1
  • Five Coding QuestionsCoding
  • Minimum Number of Steps to Make Two Strings AnagramCoding
  • Minimum Path Sum in MatrixCoding
  • Lowest Common Ancestor of a Binary TreeCoding
  • HackerRank Online AssessmentCoding
  • Reverse a Linked ListCoding
  • Reverse a Stack in Constant SpaceCoding
  • Maximum for Each Contiguous Subarray of Size KCoding
  • Tower of HanoiCoding
  • Find Element in Special Binary TreeCoding
  • Design Heap Data Structure using OOPLow-Level Design
โ† Zeotap questions
  1. Interview questions
  2. Zeotap
  3. Find Element in Special Binary Tree
Coding

Find Element in Special Binary Tree

Filed under Zeotap

The question

Find a given element in a binary tree where the root of every subtree is its smallest element and all elements in the left subtree are smaller than those in the right subtree, optimized to O(log n).

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

Related Zeotap questions

  • Five Coding Questions
  • Minimum Number of Steps to Make Two Strings Anagram
  • Minimum Path Sum in Matrix
  • Reverse a Stack in Constant Space
  • Maximum for Each Contiguous Subarray of Size K
โ† Tower of HanoiDesign Heap Data Structure using OOP โ†’

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