suvvm

摘要： Binary Tree Traversals A binary tree is a finite set of vertices that is either empty or consists of a root r and two disjoint binary trees called the 阅读全文

摘要： Fence Repair Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,0 阅读全文

摘要： Root of AVL Tree 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 mo 阅读全文

摘要： AVL Tree An AVL tree is a kind of balanced binary search tree. Named after their inventors, Adelson-Velskii and Landis, they were the first dynamicall 阅读全文

摘要： Double Queue The new founded Balkan Investment Group Bank (BIG-Bank) opened a new office in Bucharest, equipped with a modern computing environment pr 阅读全文

摘要： Hyperhuffman You might have heard about Huffman encoding - that is the coding system that minimizes the expected length of the text if the codes for c 阅读全文

摘要： The order of a Tree As we know,the shape of a binary search tree is greatly related to the order of keys we insert. To be precisely: 1. insert a key k 阅读全文

摘要： Elven Postman Elves are very peculiar creatures. As we all know, they can live for a very long time and their magical prowess are not something to be 阅读全文

摘要： HDU 3791 Falling Leaves 二叉搜索树 Figure 1Figure 1 shows a graphical representation of a binary tree of letters. People familiar with binary trees can ski 阅读全文

摘要： HDU 3791 二叉搜索树 判断两序列是否为同一二叉搜索树序列 Input开始一个数n，(1<=n<=20) 表示有n个需要判断，n= 0 的时候输入结束。 接下去一行是一个序列，序列长度小于10，包含(0~9)的数字，没有重复数字，根据这个序列可以构造出一颗二叉搜索树。 接下去的n行有n个序列， 阅读全文