Sign up
Please tick the below box to proceed
I agree (or if I am under 13 my parent or guardian agrees on my behalf) to the terms and conditions of use and that:
- My test statistics may be published on the site leaderboard against my username
- My teacher(s) can review my test scores
- I can receive feedback on my tests from my teacher(s)
Please tick this box to proceed
Already have an account? Sign in
Preview lessons, content and tests
Computer Science & Programming solved. All in one platform.
1. To trial the platform and take tests, please take a few seconds to SIGN UP and SET UP FREE.2. Searching for something specific? See our text overview of all tests. Scroll right for levels, and lists. 3. Student and Teacher User Guides | Schemes of Work | Real Teacher use Videos |
Join 36000+ teachers and students using TTIO.
Binary Trees
In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child.
PowerPoint Presentation
Suggested Video
A recursive definition using just set theory notions is that a (non-empty) binary tree is a tuple (L, S, R), where L and R are binary trees or the empty set and S is a singleton set containing the root. Some authors allow the binary tree to be the empty set as well.
Additional Reading and Resources
https://en.wikipedia.org/wiki/Binary_tree