سامانه پشتیبانی خدمات اطلاعات

  اخبار و اعلانات

 آمار

تعداد نشریات162
تعداد شماره‌ها6,693
تعداد مقالات72,239
تعداد مشاهده مقاله129,233,613
تعداد دریافت فایل اصل مقاله102,067,997
Aghaieabiane, N., Koppelaar, H., Nasehpour, Peyman. (1396). A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals. , 49(2), 1-11. doi: 10.22059/jac.2017.7972
N. Aghaieabiane; H. Koppelaar; Peyman Nasehpour. "A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals". , 49, 2, 1396, 1-11. doi: 10.22059/jac.2017.7972
Aghaieabiane, N., Koppelaar, H., Nasehpour, Peyman. (1396). 'A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals', , 49(2), pp. 1-11. doi: 10.22059/jac.2017.7972
Aghaieabiane, N., Koppelaar, H., Nasehpour, Peyman. A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals. , 1396; 49(2): 1-11. doi: 10.22059/jac.2017.7972

A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals

Journal of Algorithms and Computation
مقاله 1، دوره 49، شماره 2، اسفند 2017، صفحه 1-11    اصل مقاله (156.08 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/jac.2017.7972
نویسندگان
N. Aghaieabiane1؛ H. Koppelaar2؛ Peyman Nasehpour3
1Department of Engineering, School of Computer Science, New Jersey Institute of Technology, Newark, New Jersey, the USA.
2Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands.
3Department of Engineering Science, Golpayegan University of Technology, Golpayegan, Iran.
چکیده
Binary trees are essential structures in Computer Science. The leaf (leaves) of a binary tree is one of the most significant aspects of it. In this study, we prove that the order of a leaf (leaves) of a binary tree is the same in the main tree traversals; preorder, inorder, and postorder. Then, we prove that given the preorder and postorder traversals of a binary tree, the leaf (leaves) of a binary tree can be determined. We present the algorithm BT-LEAF, a novel one, to detect the leaf (leaves) of a binary tree from its preorder and postorder traversals in quadratic time and linear space.
کلیدواژه‌ها
Binary tree؛ Proper binary tree؛ Preorder traversal؛ Inorder traversal؛ Postorder traversal؛ time complexity؛ Space complexity
آمار
تعداد مشاهده مقاله: 1,230
تعداد دریافت فایل اصل مقاله: 865





سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب