2020 年 11月 4 日随笔档案 - EvanMeetTheWorld

摘要： serialize: input TreeNode root and output String like this “1 2 3 ... 阅读全文

posted @ 2020-11-04 23:25 EvanMeetTheWorld 阅读(19) 评论(0) 推荐(0)

摘要： we are given List tree as the input, and we are gonna find the roo... 阅读全文

posted @ 2020-11-04 22:55 EvanMeetTheWorld 阅读(41) 评论(0) 推荐(0)

摘要： LC Maximum Depth binary Tree use BFS count the level we are in. cl... 阅读全文

posted @ 2020-11-04 12:49 EvanMeetTheWorld 阅读(17) 评论(0) 推荐(0)

摘要： idea: the maxDepth of current Node is the maxDepth between its lef... 阅读全文

posted @ 2020-11-04 11:41 EvanMeetTheWorld 阅读(20) 评论(0) 推荐(0)

摘要： Base question: LC543 diameter of binary tree, LC1245 tree diameter... 阅读全文

posted @ 2020-11-04 11:25 EvanMeetTheWorld 阅读(37) 评论(0) 推荐(0)

摘要： Given an undirected tree, return it’s diameter, which is the numbe... 阅读全文

posted @ 2020-11-04 10:47 EvanMeetTheWorld 阅读(26) 评论(0) 推荐(0)

摘要： the defination of diameter of binary tree is the longest path(the ... 阅读全文

posted @ 2020-11-04 09:19 EvanMeetTheWorld 阅读(21) 评论(0) 推荐(0)

摘要： deep copy of a N-ary. we met many problems like this: clone someth... 阅读全文

posted @ 2020-11-04 06:35 EvanMeetTheWorld 阅读(36) 评论(0) 推荐(0)

摘要： Deep copy of a connected undirected graph, and there are some simi... 阅读全文

posted @ 2020-11-04 06:17 EvanMeetTheWorld 阅读(18) 评论(0) 推荐(0)

摘要： Preorder: /*// Definition for a Node.class Node { public int va... 阅读全文

posted @ 2020-11-04 00:41 EvanMeetTheWorld 阅读(26) 评论(0) 推荐(0)

EvanMeetTheWorld