From 1efedbdd9f040810ebe7ff63f736e863c36ac82a Mon Sep 17 00:00:00 2001 From: mo khan Date: Sat, 11 Jul 2020 15:46:37 -0600 Subject: Start assignment 2 --- src/02/01/README.md | 4 ++++ 1 file changed, 4 insertions(+) create mode 100644 src/02/01/README.md (limited to 'src/02/01') diff --git a/src/02/01/README.md b/src/02/01/README.md new file mode 100644 index 0000000..2a36c6b --- /dev/null +++ b/src/02/01/README.md @@ -0,0 +1,4 @@ +Design an algorithm for the following operations for a binary tree BT, and show the worst-case running times for each implementation: +* preorderNext(x): return the node visited after node x in a pre-order traversal of BT. +* postorderNext(x): return the node visited after node x in a post-order traversal of BT. +* inorderNext(x): return the node visited after node x in an in-order traversal of BT. -- cgit v1.2.3