#面试刷题 · 小土刀 5.0

2016-01-13

Inorder Traversal

Given a binary tree, return the inorder traversal of its nodes' values.

2016-01-13

给定一棵二叉查找树和一个新的树节点，将节点插入到树中。

2016-01-13

T1 and T2 are two very large binary trees, with T1 much bigger than T2.

2016-01-13

Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.

2016-01-13

Get all the paths (always starts from the root and ends at leaf) in a binary tree, whose sum would be equal to

2016-01-13

Given a binary tree, return the bottom-up level order traversal of its nodes' values.

2016-01-13

Given a binary tree, return the level order traversal of its nodes' values.

2016-01-13

给定一个二叉树，找出其最大深度。

2016-01-13

Given a binary tree, find the maximum path sum.

2016-01-13

给定一个二叉树，找出其最小深度。