## LeetCode Problem: Maximum Depth of Binary Tree

Recursively count the depth of tree node. One node&#821 […]

## LeetCode Problem: Pascal’s Triangle

The problem is simple, each element in the triangle is […]

## Algorithm Problem: Find Out the Minimum Number that Great or Equal to a Given Number In BST

Given a BST and a Number k, find out the minimum number […]

## LeetCode Problem: Populating Next Right Pointers in Each Node II

The code in the previous article LeetCode Problem: Popu […]

## LeetCode Problem: Populating Next Right Pointers in Each Node, Level traversal of binary tree

It’s easy to doing this by using a queue, doing a […]

## Algorithm Problem:Swap the left and right sub-tree in a binary tree without recursion

Just swap the tree nodes’ left and right child, i […]

## LeetCode Problem:Flatten Binary Tree to Linked List

We can notice that in the flattened tree, each sub node […]

## LeetCode题目：Binary Tree Inorder Traversal

Given a binary tree, return the inorder traversal of it […]