To the Top
File:  root - text - article - 2019 - 10 - floor-and-ceiling-of-a-binary-search-tree.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 369 Views, 23394 Search Bots | 119 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Apple:

Given an integer k and a binary search tree, find the floor (less than or equal to) of k, and the ceiling (larger than or equal to) of k. If either does not exist, then print them as None.

Here is the definition of a node for the tree.


class Node:
def __init__(self, value):
self.left = None
self.right = None
self.value = value

def findCeilingFloor(root_node, k, floor=None, ceil=None):
# Fill this in.

root = Node(8)
root.left = Node(4)
root.right = Node(12)

root.left.left = Node(2)
root.left.right = Node(6)

root.right.left = Node(10)
root.right.right = Node(14)

print findCeilingFloor(root, 5)
# (4, 6)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Cateogry: Computing | 369 Views, 23394 Search Bots | 119 Words Subscribe to Feed Burner

Related Articles

  1. Algorithm Interview: No Adjacent Repeating Characters
  2. Skip the readings, focus on problems. And use all the hints!
  3. Algorithm Interview: Level Order Traversal of Binary Tree
  4. Daily Interview Problem: First Missing Positive Integer
  5. Plus One
  6. Fix Brackets
  7. Daily Interview Problem: Sort Colors
  8. Most Frequent Subtree Sum
  9. Consecutive Ones
  10. Daily Interview Question: Edit Distance

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />