{"title":"二叉搜索树可视化算法","authors":"V. Borovskiy, J. Muller, M. Schapranow, A. Zeier","doi":"10.1109/ICIEEM.2009.5344285","DOIUrl":null,"url":null,"abstract":"Binary search tree is a very common data structure in computer programming. Working with large BSTs can become complicated and inefficient unless a programmer can visualize them. This article contributes with two BST visualization algorithms that draw a tree in time linearly proportional to the number of nodes in a tree.","PeriodicalId":6326,"journal":{"name":"2009 16th International Conference on Industrial Engineering and Engineering Management","volume":"73 1","pages":"108-112"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Binary search tree visualization algorithm\",\"authors\":\"V. Borovskiy, J. Muller, M. Schapranow, A. Zeier\",\"doi\":\"10.1109/ICIEEM.2009.5344285\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Binary search tree is a very common data structure in computer programming. Working with large BSTs can become complicated and inefficient unless a programmer can visualize them. This article contributes with two BST visualization algorithms that draw a tree in time linearly proportional to the number of nodes in a tree.\",\"PeriodicalId\":6326,\"journal\":{\"name\":\"2009 16th International Conference on Industrial Engineering and Engineering Management\",\"volume\":\"73 1\",\"pages\":\"108-112\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 16th International Conference on Industrial Engineering and Engineering Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIEEM.2009.5344285\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 16th International Conference on Industrial Engineering and Engineering Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIEEM.2009.5344285","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Binary search tree is a very common data structure in computer programming. Working with large BSTs can become complicated and inefficient unless a programmer can visualize them. This article contributes with two BST visualization algorithms that draw a tree in time linearly proportional to the number of nodes in a tree.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
