Tree Data Structure
Everything on SkillVeris tagged Tree Data Structure — collected across the glossary, study notes, blog, and cheat sheets.
7 resources across 1 library
Interview Questions(7)
What is a Trie?
A trie, or prefix tree, is a tree-based data structure that stores strings character by character along shared paths, letting you search, insert, and check pre…
What is an AVL Tree?
An AVL tree is a self-balancing binary search tree where the heights of the two child subtrees of any node differ by at most one, and it restores this balance…
What is a Segment Tree?
A segment tree is a binary tree built over an array that stores a precomputed aggregate (sum, min, max, or similar) for every contiguous sub-range at each node…
What is Level-Order Tree Traversal?
Level-order traversal visits a binary tree one depth level at a time, left to right, by pushing the root into a FIFO queue and repeatedly dequeuing a node, vis…
What is a Splay Tree?
A splay tree is a self-adjusting binary search tree that moves any node accessed — via search, insert, or delete — to the root using a sequence of rotations ca…
What is Morris Traversal?
Morris traversal is a technique for performing in-order (or pre-order) traversal of a binary tree in O(1) extra space by temporarily converting the tree into a…
What is a Threaded Binary Tree?
A threaded binary tree is a binary tree variant where null left or right child pointers are repurposed as 'threads' pointing directly to the node's in-order pr…