
数据结构 二叉树
L-YR
今天,我发现编程之美了么?
——解codes的庖丁麦兜
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
求二叉树最浅叶子结点们的和
#include <stdio.h> #include <string.h> #include <assert.h> #include <malloc.h> #define maxlen 30 typedef struct Node { struct Node * leftChild; struct Node * rightCh...原创 2019-01-13 21:29:07 · 2971 阅读 · 0 评论 -
validate-binary-search-tree
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 contains only nodes with keys less than the node's key. The ...原创 2019-01-14 19:47:26 · 200 阅读 · 0 评论