2017年8月14日
Coursera Algorithms week4 基础标签表 练习测验：Inorder traversal with constant extra space
摘要： 题目原文： Design an algorithm to perform an inorder traversal of a binary search tree using only a constant amount of extra space. 1 public void traverse( 阅读全文
posted @ 2017-08-14 17:56 evasean 阅读(845) 评论(0) 推荐(0)
Coursera Algorithms week4 基础标签表 练习测验：Check if a binary tree is a BST
摘要： 题目原文： Given a binary tree where each 𝙽𝚘𝚍𝚎 contains a key, determine whether it is a binary search tree. Use extra space proportional to the height 阅读全文
posted @ 2017-08-14 16:46 evasean 阅读(361) 评论(0) 推荐(0)