Given a complete binary tree, count the number of nodes. Note: Definition of a complete binary tree from Wikipedia:In a complete binary tree ...

A *complete* binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left ...

We are given a binary tree (with root node `root`), a `target` node, and an integer value `K`. Return a list of the values of all nodes that have ...

Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2-> ...

原题地址：http://oj.leetcode.com/problems/swap-nodes-in-pairs/ 题意：将链表中的节点两两交换。Given 1->2->3->4, you should return the list as 2->1->4-> ...

题目： Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list ...

Reference： http://blog.csdn.net/v_july_v/article/details/18312089 http://leetcode.com/2011/07 ...

原题地址：https://oj.leetcode.com/problems/count-and-say/ 题意： The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21 ...