Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.
该标签下的全部文章。
Given inorder and postorder traversal of a tree, construct the binary tree.
Given preorder and inorder traversal of a tree, construct the binary tree.
Covert a binary tree to linked lists. Each linked list is correspondent to all the nodes at the same level.
A binary search tree was created by traversing through an array from left to right and inserting each element.
You are given a list of projects and a list of projects and a list of dependencies (which is a list of pairs o
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.