EvanMeetTheWorld

摘要： Given two sorted arrays nums1 and nums2 of size m and n respective... 阅读全文

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

摘要： N-ary tree pre/in/post order traversal Construct a tree from (pre/... 阅读全文

posted @ 2020-11-05 06:24 EvanMeetTheWorld 阅读(6) 评论(0) 推荐(0)

摘要： N-ary： N-ary pre/in/post/level order traverse. Clone N-ary Diamete... 阅读全文

posted @ 2020-11-05 06:23 EvanMeetTheWorld 阅读(12) 评论(0) 推荐(0)

摘要： LeetCode 297 Serialize and Deserialize binary tree LeetCode 428 Se... 阅读全文

posted @ 2020-11-05 06:19 EvanMeetTheWorld 阅读(16) 评论(0) 推荐(0)

摘要： use level order like we always do for problems like ser and de-ser... 阅读全文

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

摘要： serialize is from a Node root to String and deserialize is from St... 阅读全文

posted @ 2020-11-05 01:03 EvanMeetTheWorld 阅读(22) 评论(0) 推荐(0)

摘要： 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 阅读(36) 评论(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 阅读(18) 评论(0) 推荐(0)