在O(N)时间内从排序值构建最优二叉搜索树

{"title":"在O(N)时间内从排序值构建最优二叉搜索树","authors":"J. Vaucher","doi":"10.1007/978-3-540-39993-3_17","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":308612,"journal":{"name":"Essays in Memory of Ole-Johan Dahl","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Building Optimal Binary Search Trees from Sorted Values in O(N) Time\",\"authors\":\"J. Vaucher\",\"doi\":\"10.1007/978-3-540-39993-3_17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":308612,\"journal\":{\"name\":\"Essays in Memory of Ole-Johan Dahl\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Essays in Memory of Ole-Johan Dahl\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-540-39993-3_17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Essays in Memory of Ole-Johan Dahl","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-540-39993-3_17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}