摘要:
Given a binary tree, collect a tree's nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty. Have you met thi 阅读全文
posted @ 2017-09-07 06:12
Review->Improve
阅读(266)
评论(0)
推荐(0)
摘要:
Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column). If two nodes are in the sam 阅读全文
posted @ 2017-09-07 04:48
Review->Improve
阅读(352)
评论(0)
推荐(0)
摘要:
Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all 阅读全文
posted @ 2017-09-07 01:56
Review->Improve
阅读(141)
评论(0)
推荐(0)
摘要:
Given a binary tree, check whether it is a mirror of itself using both recursion and iterative approach. Examples: Solution 1. Recursion For two trees 阅读全文
posted @ 2017-09-07 00:33
Review->Improve
阅读(178)
评论(0)
推荐(0)

浙公网安备 33010602011771号