From aa0edd0d0b1ceb9e5986c909d368364c8fbbf976 Mon Sep 17 00:00:00 2001 From: mo khan Date: Sun, 23 Aug 2020 12:02:37 -0600 Subject: Add problem from 3 days ago --- 2020/08/20/README.md | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 2020/08/20/README.md diff --git a/2020/08/20/README.md b/2020/08/20/README.md new file mode 100644 index 0000000..9bdb6b7 --- /dev/null +++ b/2020/08/20/README.md @@ -0,0 +1,23 @@ +│ 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) + -- cgit v1.2.3