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 | 208 Views, 15330 Search Bots | 128 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 208 Views, 15330 Search Bots | 128 Words
| 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:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 208 Views, 15330 Search Bots | 128 Words 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
Related Articles
- Algorithm Interview: String Compression
- Patterns for breaking down questions you haven
- Algorithm Interview: Longest Consecutive Sequence
- Daily Interview Problem: Spiral Traversal of Grid
- Daily Interview Problem: Count Number of Unival Subtrees
- Algorithm Interview: Determine If Linked List is Palindrome
- Design Tic-Tac-Toe
- Sort a Partially Sorted List
- Daily Interview Question: Edit Distance
- Algorithm Interview: Make the Largest Number
©2006~2024 SteakOverCooked - 0.01471 Seconds(s) - 1401.594 KB/s - 117 Online Memory: 494.61 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !