5.1 Trees
This section discusses binary trees, focusing on their logical operation and specific terms like parent, left-child, right-child, subtree, root, and leaf. It also mentions tree traversal methods like inorder, postorder, and preorder. Lastly, it encourages sketching diagrams to illustrate various operations on binary trees.
To access the entire contents of this site, you need to log in or subscribe to it.
Alternatively, you can request a one month free trial.