Joilee

摘要： 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... 阅读全文

摘要： Given a non-empty tree with root R, and with weight Wiassigned to each tree node Ti. Theweight of a path from R to Lis defined to be the sum of the we... 阅读全文

摘要： A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.InputEach input file contains ... 阅读全文

摘要： A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）-- everyone involved in moving a product from supplier to customer... 阅读全文

摘要： A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）-- everyone involved in moving a product from supplier to customer... 阅读全文

摘要： An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the... 阅读全文

摘要： 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 wit... 阅读全文

摘要： Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to ou... 阅读全文

摘要： One important factor to identify acute stroke (急性脑卒中) is the volume of the stroke core. Given the results of image analysis in which the core regions ... 阅读全文

摘要： 给定一个常数K以及一个单链表L，请编写程序将L中每K个结点反转。例如：给定L为1→2→3→4→5→6，K为3，则输出应该为3→2→1→6→5→4；如果K为4，则输出应该为4→3→2→1→5→6，即最后不到K个元素不反转。输入格式：每个输入包含1个测试用例。每个测试用例第1行给出第1个结点的地址、结点... 阅读全文