diff options
| author | mo khan <mo.khan@gmail.com> | 2020-07-11 15:46:37 -0600 |
|---|---|---|
| committer | mo khan <mo.khan@gmail.com> | 2020-07-11 15:46:37 -0600 |
| commit | 1efedbdd9f040810ebe7ff63f736e863c36ac82a (patch) | |
| tree | 3abf7b9999d4431415d587a3ea379fad15ff6422 /src/02/01/README.md | |
| parent | 7875e6df22f74499a6d756a87740f2c27cbf081a (diff) | |
Start assignment 2
Diffstat (limited to 'src/02/01/README.md')
| -rw-r--r-- | src/02/01/README.md | 4 |
1 files changed, 4 insertions, 0 deletions
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. |