二叉搜索树
文章平均质量分 78
小雪乃
这个作者很懒,什么都没留下…
展开
-
PAT 甲级 1099. Build A Binary Search Tree (30)
c A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only nodes with keys less than the node's key. The r原创 2017-10-06 23:19:52 · 170 阅读 · 0 评论 -
PAT 甲级 1064. Complete Binary Search Tree (30)
A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only nodes with keys less than the node's key. The righ原创 2017-10-02 00:08:12 · 199 阅读 · 0 评论 -
PAT 甲级 1115. Counting Nodes in a BST (30)
A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than or equal to the node’s key. The原创 2017-10-18 08:02:16 · 234 阅读 · 0 评论 -
PAT 甲级 1123. Is It a Complete AVL Tree (30)
An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is转载 2017-10-20 06:57:38 · 257 阅读 · 0 评论