摘要：
Given a binary tree, return the preorder traversal of its nodes' values. Example: 阅读全文
posted @ 2019-08-27 11:26
Schwifty
阅读(138)
评论(0)
推荐(0)
摘要：
Implement the following operations of a queue using stacks. push(x) -- Push element x to the back of queue. pop() -- Removes the element from in front 阅读全文
posted @ 2019-08-27 10:13
Schwifty
阅读(115)
评论(0)
推荐(0)
摘要：
Implement the following operations of a stack using queues. push(x) -- Push element x onto stack. pop() -- Removes the element on top of the stack. to 阅读全文
posted @ 2019-08-27 02:02
Schwifty
阅读(118)
评论(0)
推荐(0)
浙公网安备 33010602011771号