摘要：
Problem : Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given bin 阅读全文
posted @ 2020-02-17 22:01
littledy
阅读(82)
评论(0)
推荐(0)
摘要：
Problem : Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node con 阅读全文
posted @ 2020-02-17 21:14
littledy
阅读(96)
评论(0)
推荐(0)
摘要：
Problem : Given an integer n , generate all structurally unique BST's (binary search trees) that store values 1 ... n . Example: 思路 ： 同样采用递归的思想。若节点$i$ 阅读全文
posted @ 2020-02-17 10:13
littledy
阅读(90)
评论(0)
推荐(0)
浙公网安备 33010602011771号