摘要： As we know, if we traverse in from left to right level order, we can use a Queue to store all the nodes in this level from left to right. While in zig 阅读全文

摘要： Using DFS to traverse the BST, when we look through the BST to a certain node, this node must have the following property to make sure the tree is a v 阅读全文