BST Traversal
Prompt
Write three functions that take in a Binary Search Tree (BST) and an empty array, traverse the BST, add its nodes’ values to the input array, and return that array. The three functions should traverse the BST using the
in-order, pre-order, and post-
原创
2020-06-28 18:00:21 ·
133 阅读 ·
0 评论