To the Top
File:  root - text - article - 2019 - 11 - validate-binary-search-tree.txt.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 407 Views, 17429 Search Bots | 128 Words

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

You are given the root of a binary search tree. Return true if it is a valid binary search tree, and false otherwise. Recall that a binary search tree has the property that all values in the left subtree are less than or equal to the root, and all values in the right subtree are greater than or equal to the root.

Here's a starting point:


class TreeNode:
def __init__(self, key):
self.left = None
self.right = None
self.key = key

def is_bst(root):
# Fill this in.

a = TreeNode(5)
a.left = TreeNode(3)
a.right = TreeNode(7)
a.left.left = TreeNode(1)
a.left.right = TreeNode(4)
a.right.left = TreeNode(6)
print is_bst(a)

# 5
# / \
# 3 7
# / \ /
#1 4 6
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 407 Views, 17429 Search Bots | 128 Words Subscribe to Feed Burner

Related Articles

  1. Spreadsheet Columns
  2. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  3. A trick for getting good at coding interviews FASTER
  4. Daily Interview Problem: Min Range Needed to Sort
  5. [Daily Problem] Course Prerequisites
  6. Autorun.inf Virus Protection
  7. PHP Unit Tests on VPS Server
  8. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  9. Daily Interview Problem: Reverse Words in a String
  10. Daily Interview Problem: Contiguous Subarray with Maximum Sum

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" />