algo
文章平均质量分 76
livedrm
try try try to touch the seventh layer
展开
-
AVL树基本原理
在算法与数据结构中对平衡二叉搜索树的AVL树的定义是如下, a tree is balanced if and only if for every node the heights of its two subtrees differ by at most 1. Trees satisfying this condition are often called AVL-trees( After原创 2012-04-19 10:22:33 · 1720 阅读 · 0 评论 -
AVL树插入的简单实现
avl.h #ifndef _AVL_TREE_H #define _AVL_TREE_H struct avl_node { avl_node(int k); int key; char bf;//Hight(left) - Hight(right), balance factor[-1, 0, 1]. avl_原创 2012-05-03 09:08:15 · 498 阅读 · 0 评论