2021年7月8日
对称二叉树 · symmetric binary tree
摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文
posted @ 2021-07-08 01:25 苗妙苗 阅读(42) 评论(0) 推荐(0)
108 Convert Sorted Array to Binary Search Tree数组变成高度平衡的二叉树
摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is d 阅读全文
posted @ 2021-07-08 00:18 苗妙苗 阅读(35) 评论(0) 推荐(0)