binary tree
A binary tree is a hierarchical data structure in computer science composed of nodes, where each node can have at most two children nodes. The tree starts with a root node and branches out from there, with each node having a left and/or right child node. This structure allows for efficient searching, insertion, and deletion operations.
Requires login.
Related Concepts (27)
- avl tree
- b-tree
- balanced binary tree
- binary heap
- binary heap implementation
- binary heap visualization
- binary min-heap
- binary search tree
- binary tree properties
- binary tree traversal algorithms
- breadth-first search (bfs)
- complete binary tree
- deletion in a binary heap
- depth of a binary tree
- depth-first search (dfs)
- heap
- huffman coding
- inorder traversal
- insertion in a binary heap
- perfect binary tree
- postorder traversal
- preorder traversal
- priority queue
- red-black tree
- splay tree
- tree rotations
- trie