Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
该标签下的全部文章。
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.
There are a total of n courses you have to take, labeled from 0 to n - 1.
Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node.
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.