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

摘要： To search a key in a binary search tree, we start from the root and move all the way down, choosing branches according to the comparison results of th... 阅读全文

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

摘要： 本来以为笔试就会被刷的，没想到腾讯还给我面试机会了。可能因为笔试成绩不高，从后台开发被调剂到了安全技术岗。虽然下午去市区面试的耗时很短而且被拒了，但还是学到不少东西。 面试官没让自我介绍，直接问我有没有做过和安全有关的东西。然后结合项目主要问了三个问题：1、sql注入的原理是什么我絮絮叨叨说了一点... 阅读全文

摘要： 题目地址http://www.patest.cn/contests/mooc-ds2015spring/03-%E6%A0%912An inorder binary tree traversal can be implemented in a non-recursive way with a sta... 阅读全文

摘要： 题目链接：http://www.patest.cn/contests/mooc-ds/03-2Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.Input... 阅读全文