#树和图 · 小土刀 5.0

2016-01-14

All Path

Given a binary tree, return all root-to-leaf paths.

2016-01-14

Given a binary tree, determine if it is height-balanced.

2016-01-14

Implement an iterator over a binary search tree (BST).

2016-01-14

Compute the depth of a binary tree.

2016-01-14

Given inorder and postorder traversal of a tree, construct the binary tree.

2016-01-14

Given preorder and inorder traversal of a tree, construct the binary tree.

2016-01-14

Covert a binary tree to linked lists. Each linked list is correspondent to all the nodes at the same level.

2016-01-14

A binary search tree was created by traversing through an array from left to right and inserting each element.

2016-01-14

You are given a list of projects and a list of projects and a list of dependencies (which is a list of pairs o

2016-01-14

Given two binary trees, write a function to check if they are equal or not.