![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
递归
zyp7355
这个作者很懒,什么都没留下…
展开
-
leetcode#116 Populating Next Right Pointers in Each Node
You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:struct Node {int val;Node *left;Node *ri...原创 2020-02-29 05:25:42 · 73 阅读 · 0 评论 -
leetcode#109. Convert Sorted List to Binary Search Tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is defined as a binary tree in which the d...原创 2020-02-26 13:47:17 · 63 阅读 · 0 评论