摘要: 二叉树的最近公共祖先 Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia: 阅读全文
posted @ 2020-04-29 06:15 闲云潭影 阅读(153) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree struct Node { int val; Node *left; Node *right; Node *next; } Populate each next pointer to point to its next right node. If there 阅读全文
posted @ 2020-04-29 05:23 闲云潭影 阅读(125) 评论(0) 推荐(0) 编辑