Binary tree and BST tool

Draw a binary tree and get what ISC Computer Science asks about it: the preorder, inorder and postorder traversals, the height and levels, leaves, internal nodes, and each node's parent, children and sibling. Build it by inserting values into a binary search tree, give it level by level, or rebuild it from two traversals.

Build the tree

Insert into a BSTLevel by levelFrom traversals

Values, in the order they are inserted

Numbers go by value, words alphabetically (MANGO, APPLE, PEAR ...).

Build the tree

Separate the values with commas or spaces.

Try: BST: 50, 30, 70, 20, 40, 60, 80BST: MANGO, BANANA, PEAR, APPLE, ORANGEA, B, C, D, -, E, Finorder + preorderinorder + postorder

Practise on real ISC questions

• Answer the following questions from the diagram of a Binary Tree given below: Name the root of the left sub… 2025 Specimen
• Answer the following questions from the diagram of a Binary Tree given below: Write the post-order traversal… 2026 Improvement
• State the difference between internal nodes and external nodes of a binary tree structure. 2019
• Write the pre-order traversal of the above tree. 2026
• Write the postorder traversal of the above tree structure. 2017
• State the difference between a Binary Tree structure and a single Linked List. 2020
• Answer the following questions from the diagram of a Binary Tree given below: Write the pre-order traversal… 2023
• Write the inorder traversal of the above tree structure. 2018
• Write the post order traversal of the tree. 2020 Specimen
• Write the post-order traversal of the left subtree of the above structure. 2020

More Computer Science tools

• Boolean algebra solver Simplify any expression: the laws step by step, truth table, K-map and the logic circuit.
• Infix to postfix converter Infix to postfix or prefix with the stack table, and postfix evaluation step by step.

All study tools ›