[leetcode] Serialize / Deserialize BST | BST的存储和重建

Posted by: lexigrey on: October 15, 2013

• In: leetcode
• Leave a Comment

这个是left bound, right bound来check if a tree is a BST的变形。愣是没看出来。还是不熟练，桑心。挖坑，要是明天挂了回来接着写。

http://leetcode.com/2010/09/saving-binary-search-tree-to-file.html

Advertisements

Tags: tree, 前序