From 072febeb9c125b7e3a5bdb93bd098de579b00914 Mon Sep 17 00:00:00 2001 From: marina <138340846+bt3gl-cryptographer@users.noreply.github.com> Date: Thu, 3 Aug 2023 16:02:59 -0700 Subject: [PATCH] Update README.md --- trees/README.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/trees/README.md b/trees/README.md index c0ee24f..d668255 100644 --- a/trees/README.md +++ b/trees/README.md @@ -383,7 +383,8 @@ def dfs(root, visited):
- `left -> node -> right` -- in a bst, in-order traversal will be in ascending order (therefore, it's the most frequently used method). +- in a bst, in-order traversal will be sorted in the ascending order (therefore, it's the most frequently used method). +- note, however, that convert a sorted array to a bst with inorder has no unique solution (at the same time, both preorder and postorder are unique identifiers of a bst). ```python def inorder(self, root):